./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da6ef4fc5dac50b4d28cdb6a2651e875027ea78107a6a98d77f5bcb3b6ca789e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:00,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:00,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:01,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:01,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:01,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:01,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:01,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:01,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:01,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:01,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:01,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:01,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:01,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:01,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:01,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:01,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:01,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:01,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:01,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:01,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:01,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:01,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:01,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:01,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:01,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:01,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:01,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:01,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:01,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:01,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:01,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:01,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:01,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:01,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:01,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:01,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:01,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:01,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:01,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:01,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:01,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:01,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da6ef4fc5dac50b4d28cdb6a2651e875027ea78107a6a98d77f5bcb3b6ca789e [2024-10-31 22:17:01,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:01,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:01,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:01,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:01,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:01,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i Unable to find full path for "g++" [2024-10-31 22:17:03,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:04,012 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:04,012 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i [2024-10-31 22:17:04,025 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/e02f759c6/e75ab2eaefb64f968779e1d0a7e64118/FLAG03453cf53 [2024-10-31 22:17:04,053 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/e02f759c6/e75ab2eaefb64f968779e1d0a7e64118 [2024-10-31 22:17:04,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:04,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:04,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:04,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:04,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:04,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795495e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04, skipping insertion in model container [2024-10-31 22:17:04,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:04,308 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i[916,929] [2024-10-31 22:17:04,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:04,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:04,411 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i[916,929] [2024-10-31 22:17:04,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:04,507 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:04,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04 WrapperNode [2024-10-31 22:17:04,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:04,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:04,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:04,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:04,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,579 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2024-10-31 22:17:04,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:04,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:04,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:04,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:04,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,630 INFO L175 MemorySlicer]: Split 142 memory accesses to 7 slices as follows [2, 8, 23, 19, 39, 36, 15]. 27 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 3, 3, 4, 4, 2]. The 20 writes are split as follows [0, 1, 3, 3, 5, 6, 2]. [2024-10-31 22:17:04,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:04,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:04,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:04,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:04,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (1/1) ... [2024-10-31 22:17:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:04,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:04,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:04,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:04,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:17:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:17:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 22:17:04,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 22:17:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 22:17:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 22:17:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 22:17:04,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:17:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:17:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:17:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 22:17:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 22:17:04,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 22:17:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 22:17:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:17:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:17:04,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 22:17:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 22:17:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 22:17:04,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 22:17:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 22:17:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:17:04,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:17:04,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:17:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 22:17:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 22:17:04,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 22:17:04,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 22:17:04,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 22:17:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 22:17:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:04,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:17:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:17:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:17:04,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 22:17:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 22:17:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 22:17:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 22:17:04,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:04,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:05,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:05,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:05,668 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:05,669 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:05,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:05,693 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:05,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:05 BoogieIcfgContainer [2024-10-31 22:17:05,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:05,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:05,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:05,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:05,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:04" (1/3) ... [2024-10-31 22:17:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5405b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:05, skipping insertion in model container [2024-10-31 22:17:05,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:04" (2/3) ... [2024-10-31 22:17:05,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5405b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:05, skipping insertion in model container [2024-10-31 22:17:05,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:05" (3/3) ... [2024-10-31 22:17:05,709 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-68.i [2024-10-31 22:17:05,726 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:05,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:05,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:05,803 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ee106f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:05,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:05,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:05,830 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:05,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1855113070, now seen corresponding path program 1 times [2024-10-31 22:17:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348128711] [2024-10-31 22:17:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:06,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348128711] [2024-10-31 22:17:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348128711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:06,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:06,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283874005] [2024-10-31 22:17:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:06,497 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:06,535 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-10-31 22:17:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:06,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-31 22:17:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:06,547 INFO L225 Difference]: With dead ends: 221 [2024-10-31 22:17:06,547 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:17:06,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:06,554 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:06,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:17:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-31 22:17:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-10-31 22:17:06,604 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-10-31 22:17:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-10-31 22:17:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-10-31 22:17:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:06,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:06,610 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:06,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:06,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:06,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash 835025800, now seen corresponding path program 1 times [2024-10-31 22:17:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224628598] [2024-10-31 22:17:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224628598] [2024-10-31 22:17:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224628598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874439250] [2024-10-31 22:17:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:07,080 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:07,146 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-31 22:17:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:07,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-31 22:17:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:07,148 INFO L225 Difference]: With dead ends: 219 [2024-10-31 22:17:07,149 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:17:07,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:07,151 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:07,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:17:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:17:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-10-31 22:17:07,166 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2024-10-31 22:17:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:07,167 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-10-31 22:17:07,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-10-31 22:17:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:07,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:07,171 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:07,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1783077766, now seen corresponding path program 1 times [2024-10-31 22:17:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638762792] [2024-10-31 22:17:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638762792] [2024-10-31 22:17:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638762792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699835573] [2024-10-31 22:17:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:07,690 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:07,746 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-10-31 22:17:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-31 22:17:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:07,748 INFO L225 Difference]: With dead ends: 224 [2024-10-31 22:17:07,749 INFO L226 Difference]: Without dead ends: 115 [2024-10-31 22:17:07,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:07,751 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:07,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-31 22:17:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-31 22:17:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-31 22:17:07,764 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 146 [2024-10-31 22:17:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:07,765 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-31 22:17:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-31 22:17:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:07,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:07,768 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:07,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:07,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1733707370, now seen corresponding path program 1 times [2024-10-31 22:17:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017806311] [2024-10-31 22:17:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:08,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017806311] [2024-10-31 22:17:08,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017806311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:08,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:08,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486668564] [2024-10-31 22:17:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:08,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:08,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:08,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:08,147 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:08,192 INFO L93 Difference]: Finished difference Result 230 states and 331 transitions. [2024-10-31 22:17:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-31 22:17:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:08,194 INFO L225 Difference]: With dead ends: 230 [2024-10-31 22:17:08,194 INFO L226 Difference]: Without dead ends: 118 [2024-10-31 22:17:08,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:08,197 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:08,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-31 22:17:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-31 22:17:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-10-31 22:17:08,244 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2024-10-31 22:17:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-10-31 22:17:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-10-31 22:17:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:08,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:08,252 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:08,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:08,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash -861623189, now seen corresponding path program 1 times [2024-10-31 22:17:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096352944] [2024-10-31 22:17:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096352944] [2024-10-31 22:17:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096352944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981689822] [2024-10-31 22:17:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:08,544 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:08,583 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-10-31 22:17:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:08,585 INFO L225 Difference]: With dead ends: 232 [2024-10-31 22:17:08,585 INFO L226 Difference]: Without dead ends: 119 [2024-10-31 22:17:08,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:08,587 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:08,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-31 22:17:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-31 22:17:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-10-31 22:17:08,595 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2024-10-31 22:17:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:08,596 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-10-31 22:17:08,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-10-31 22:17:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:08,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:08,598 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:08,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:08,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:08,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash -160558611, now seen corresponding path program 1 times [2024-10-31 22:17:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:08,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105373752] [2024-10-31 22:17:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:08,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:08,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105373752] [2024-10-31 22:17:08,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105373752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531734052] [2024-10-31 22:17:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:08,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:08,806 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:08,845 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-10-31 22:17:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:08,848 INFO L225 Difference]: With dead ends: 236 [2024-10-31 22:17:08,848 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 22:17:08,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:08,849 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:08,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 22:17:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-10-31 22:17:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-10-31 22:17:08,891 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2024-10-31 22:17:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:08,892 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-10-31 22:17:08,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-10-31 22:17:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:08,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:08,899 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:17:08,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1614448751, now seen corresponding path program 1 times [2024-10-31 22:17:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657014925] [2024-10-31 22:17:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657014925] [2024-10-31 22:17:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657014925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:09,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842676434] [2024-10-31 22:17:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:09,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:09,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:09,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:09,136 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:09,168 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-10-31 22:17:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:09,171 INFO L225 Difference]: With dead ends: 240 [2024-10-31 22:17:09,171 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 22:17:09,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:09,172 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:09,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 22:17:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-31 22:17:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-10-31 22:17:09,192 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2024-10-31 22:17:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-10-31 22:17:09,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-10-31 22:17:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:09,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:09,197 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:09,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:17:09,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1616295793, now seen corresponding path program 1 times [2024-10-31 22:17:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654804006] [2024-10-31 22:17:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 22:17:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:17:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:17:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:17:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:17:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:17:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:17:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:17:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:17:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:17:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:17:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:17:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:17:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654804006] [2024-10-31 22:17:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654804006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:17:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444400910] [2024-10-31 22:17:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:09,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:17:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:17:09,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:17:09,727 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:09,745 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-10-31 22:17:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:17:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:09,748 INFO L225 Difference]: With dead ends: 241 [2024-10-31 22:17:09,748 INFO L226 Difference]: Without dead ends: 122 [2024-10-31 22:17:09,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:17:09,749 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:09,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-31 22:17:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-31 22:17:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-10-31 22:17:09,767 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2024-10-31 22:17:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:09,768 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-10-31 22:17:09,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-10-31 22:17:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:09,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:09,774 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:09,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:17:09,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:09,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1678335407, now seen corresponding path program 1 times [2024-10-31 22:17:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681132362] [2024-10-31 22:17:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:17:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936746029] [2024-10-31 22:17:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:17:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:09,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:17:09,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:17:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:10,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:17:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:11,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:17:11,367 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:17:11,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:17:11,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:17:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:17:11,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:11,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:17:11,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:17:11 BoogieIcfgContainer [2024-10-31 22:17:11,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:17:11,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:17:11,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:17:11,732 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:17:11,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:05" (3/4) ... [2024-10-31 22:17:11,736 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:17:11,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:17:11,738 INFO L158 Benchmark]: Toolchain (without parser) took 7678.36ms. Allocated memory was 138.4MB in the beginning and 237.0MB in the end (delta: 98.6MB). Free memory was 98.8MB in the beginning and 74.8MB in the end (delta: 24.0MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,739 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory was 85.2MB in the beginning and 85.0MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:11,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.83ms. Allocated memory is still 138.4MB. Free memory was 98.5MB in the beginning and 81.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.29ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 77.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,740 INFO L158 Benchmark]: Boogie Preprocessor took 131.06ms. Allocated memory is still 138.4MB. Free memory was 77.2MB in the beginning and 72.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,741 INFO L158 Benchmark]: RCFGBuilder took 981.91ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 72.1MB in the beginning and 134.1MB in the end (delta: -62.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,741 INFO L158 Benchmark]: TraceAbstraction took 6031.91ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 134.1MB in the beginning and 74.8MB in the end (delta: 59.3MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:11,741 INFO L158 Benchmark]: Witness Printer took 5.83ms. Allocated memory is still 237.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:11,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory was 85.2MB in the beginning and 85.0MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.83ms. Allocated memory is still 138.4MB. Free memory was 98.5MB in the beginning and 81.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.29ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 77.2MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.06ms. Allocated memory is still 138.4MB. Free memory was 77.2MB in the beginning and 72.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 981.91ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 72.1MB in the beginning and 134.1MB in the end (delta: -62.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6031.91ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 134.1MB in the beginning and 74.8MB in the end (delta: 59.3MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. * Witness Printer took 5.83ms. Allocated memory is still 237.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[3] = { 999.8, 25.5, 9999999999999.729 }; [L25-L27] double double_Array_0[3] = { 999.8, 25.5, 9999999999999.729 }; [L25-L27] double double_Array_0[3] = { 999.8, 25.5, 9999999999999.729 }; [L25-L27] double double_Array_0[3] = { 999.8, 25.5, 9999999999999.729 }; [L28-L30] float float_Array_0[3] = { 32.375, 16.8, 64.5 }; [L28-L30] float float_Array_0[3] = { 32.375, 16.8, 64.5 }; [L28-L30] float float_Array_0[3] = { 32.375, 16.8, 64.5 }; [L28-L30] float float_Array_0[3] = { 32.375, 16.8, 64.5 }; [L31-L33] signed long int signed_long_int_Array_0[2][2] = { {10, 5}, {-10, 32} }; [L31-L33] signed long int signed_long_int_Array_0[2][2] = { {10, 5}, {-10, 32} }; [L31-L33] signed long int signed_long_int_Array_0[2][2] = { {10, 5}, {-10, 32} }; [L31-L33] signed long int signed_long_int_Array_0[2][2] = { {10, 5}, {-10, 32} }; [L31-L33] signed long int signed_long_int_Array_0[2][2] = { {10, 5}, {-10, 32} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {-25, -64}, {-8, 0} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {-25, -64}, {-8, 0} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {-25, -64}, {-8, 0} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {-25, -64}, {-8, 0} }; [L34-L36] signed short int signed_short_int_Array_0[2][2] = { {-25, -64}, {-8, 0} }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 0, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 0, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 0, 8 }; [L40] signed long int last_1_signed_long_int_Array_0_0__1_ = 5; [L41] signed short int last_1_signed_short_int_Array_0_0__0_ = -25; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L104] EXPR signed_long_int_Array_0[0][1] [L104] last_1_signed_long_int_Array_0_0__1_ = signed_long_int_Array_0[0][1] [L105] EXPR signed_short_int_Array_0[0][0] [L105] last_1_signed_short_int_Array_0_0__0_ = signed_short_int_Array_0[0][0] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] double_Array_0[0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0] [L79] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L79] EXPR double_Array_0[0] [L79] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] double_Array_0[2] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[2] [L81] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L81] EXPR double_Array_0[2] [L81] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] float_Array_0[1] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[1] [L83] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L83] EXPR float_Array_0[1] [L83] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] float_Array_0[2] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_long_int_Array_0[0][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L94] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] signed_short_int_Array_0[1][1] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[1][1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[1][1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L100] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L101] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L101] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L101] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L116] RET updateVariables() [L117] CALL step() [L45] EXPR signed_long_int_Array_0[0][0] [L45] signed long int stepLocal_2 = signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_; [L46] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L53] EXPR signed_short_int_Array_0[1][1] [L53] signed_short_int_Array_0[0][0] = signed_short_int_Array_0[1][1] [L55] EXPR signed_short_int_Array_0[0][0] [L55] EXPR signed_short_int_Array_0[0][1] [L55] signed_long_int_Array_0[0][1] = (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1]) [L56] EXPR unsigned_long_int_Array_0[1] [L56] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L57] EXPR double_Array_0[0] [L57] float_Array_0[0] = double_Array_0[0] [L58] EXPR signed_long_int_Array_0[0][1] [L58] signed_long_int_Array_0[1][0] = signed_long_int_Array_0[0][1] [L59] EXPR signed_long_int_Array_0[0][1] [L59] signed long int stepLocal_1 = signed_long_int_Array_0[0][1]; [L60] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L60] COND FALSE !(stepLocal_1 != signed_long_int_Array_0[1][0]) [L63] EXPR unsigned_long_int_Array_0[0] [L63] EXPR signed_long_int_Array_0[1][0] [L63] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]; [L64] EXPR float_Array_0[2] [L64] EXPR float_Array_0[1] [L64] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] COND FALSE !((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) [L69] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR float_Array_0[2] [L108] EXPR float_Array_0[1] [L108] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1) [L108] EXPR unsigned_long_int_Array_0[0] [L108] EXPR signed_long_int_Array_0[1][0] [L108] EXPR signed_short_int_Array_0[0][0] [L108] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1 [L108] EXPR signed_long_int_Array_0[1][1] [L108] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]) [L108] EXPR signed_long_int_Array_0[1][0] [L108] EXPR ((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR (((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_long_int_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108] EXPR ((((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_long_int_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L108-L109] return ((((((((float_Array_0[2] - float_Array_0[1]) >= double_Array_0[1]) ? (((unsigned_long_int_Array_0[0] + signed_long_int_Array_0[1][0]) >= (signed_short_int_Array_0[0][0] / signed_long_int_Array_0[0][0])) ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) < 0 ) ? -(signed_long_int_Array_0[1][0]) : (signed_long_int_Array_0[1][0]))))) : 1) : (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((((signed_long_int_Array_0[1][0]) > (unsigned_long_int_Array_0[0])) ? (signed_long_int_Array_0[1][0]) : (unsigned_long_int_Array_0[0]))))) : 1)) && ((signed_long_int_Array_0[0][1] != signed_long_int_Array_0[1][0]) ? (double_Array_0[1] == ((double) (double_Array_0[2] - double_Array_0[0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_signed_short_int_Array_0_0__0_ <= (signed_long_int_Array_0[0][0] + last_1_signed_long_int_Array_0_0__1_)) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((signed_short_int_Array_0[0][1] + signed_short_int_Array_0[1][1]) + signed_short_int_Array_0[1][0]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1]))) : (signed_short_int_Array_0[0][0] == ((signed short int) signed_short_int_Array_0[1][1])))) && (signed_long_int_Array_0[0][1] == ((signed long int) (signed_short_int_Array_0[0][0] + signed_short_int_Array_0[0][1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_long_int_Array_0[1][0] == ((signed long int) signed_long_int_Array_0[0][1])) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=5, last_1_signed_short_int_Array_0_0__0_=-25, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 3551 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2288 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1263 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4352/4352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:17:11,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da6ef4fc5dac50b4d28cdb6a2651e875027ea78107a6a98d77f5bcb3b6ca789e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:14,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:14,298 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:17:14,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:14,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:14,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:14,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:14,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:14,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:14,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:14,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:14,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:14,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:14,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:14,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:14,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:14,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:14,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:14,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:14,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:14,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:14,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:14,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:14,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:17:14,341 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:17:14,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:14,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:17:14,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:14,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:14,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:14,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:14,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:14,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:14,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:14,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:14,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:14,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:14,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:14,349 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:17:14,349 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:17:14,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:14,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:14,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:14,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:14,351 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:17:14,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da6ef4fc5dac50b4d28cdb6a2651e875027ea78107a6a98d77f5bcb3b6ca789e [2024-10-31 22:17:14,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:14,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:14,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:14,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:14,793 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:14,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i Unable to find full path for "g++" [2024-10-31 22:17:16,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:17,232 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:17,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i [2024-10-31 22:17:17,252 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/9182c837d/2e193103a33b4041a6a077c40a61376c/FLAGab08d58b7 [2024-10-31 22:17:17,563 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/data/9182c837d/2e193103a33b4041a6a077c40a61376c [2024-10-31 22:17:17,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:17,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:17,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:17,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:17,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:17,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:17" (1/1) ... [2024-10-31 22:17:17,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f54cd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:17, skipping insertion in model container [2024-10-31 22:17:17,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:17" (1/1) ... [2024-10-31 22:17:17,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:17,914 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i[916,929] [2024-10-31 22:17:18,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:18,068 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:18,086 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-68.i[916,929] [2024-10-31 22:17:18,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:18,217 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:18,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18 WrapperNode [2024-10-31 22:17:18,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:18,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:18,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:18,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:18,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,330 INFO L138 Inliner]: procedures = 39, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2024-10-31 22:17:18,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:18,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:18,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:18,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:18,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,403 INFO L175 MemorySlicer]: Split 142 memory accesses to 7 slices as follows [2, 8, 23, 19, 39, 36, 15]. 27 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 3, 3, 4, 4, 2]. The 20 writes are split as follows [0, 1, 3, 3, 5, 6, 2]. [2024-10-31 22:17:18,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:18,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:18,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:18,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:18,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:18,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:18,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:18,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:18,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:17:18,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:17:18,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-31 22:17:18,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-31 22:17:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-31 22:17:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-31 22:17:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-31 22:17:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:17:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:17:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-31 22:17:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-31 22:17:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-31 22:17:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-31 22:17:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-31 22:17:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:17:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:17:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-31 22:17:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-31 22:17:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-31 22:17:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-31 22:17:18,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-31 22:17:18,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-31 22:17:18,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-31 22:17:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-31 22:17:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-31 22:17:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-31 22:17:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-31 22:17:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-31 22:17:18,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:17:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:17:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:17:18,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-31 22:17:18,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-31 22:17:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-31 22:17:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-31 22:17:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 22:17:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 22:17:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-31 22:17:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-31 22:17:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-31 22:17:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-31 22:17:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-31 22:17:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:17:18,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:17:18,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-31 22:17:18,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-31 22:17:18,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-31 22:17:18,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-31 22:17:18,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-31 22:17:18,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:17:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:17:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-31 22:17:18,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-31 22:17:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-31 22:17:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-31 22:17:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-31 22:17:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:17:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:17:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:17:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-31 22:17:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-31 22:17:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-31 22:17:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-31 22:17:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-31 22:17:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-31 22:17:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-31 22:17:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-31 22:17:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-31 22:17:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-31 22:17:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-31 22:17:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-31 22:17:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:18,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:18,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:17:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-31 22:17:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-31 22:17:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-31 22:17:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-31 22:17:18,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:18,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:21,786 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:21,786 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:21,815 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:21,815 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:21,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:21 BoogieIcfgContainer [2024-10-31 22:17:21,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:21,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:21,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:21,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:21,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:17" (1/3) ... [2024-10-31 22:17:21,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ee27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:21, skipping insertion in model container [2024-10-31 22:17:21,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18" (2/3) ... [2024-10-31 22:17:21,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ee27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:21, skipping insertion in model container [2024-10-31 22:17:21,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:21" (3/3) ... [2024-10-31 22:17:21,830 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-68.i [2024-10-31 22:17:21,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:21,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:21,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:21,948 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34e8dff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:21,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:21,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:21,978 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:21,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1855113070, now seen corresponding path program 1 times [2024-10-31 22:17:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197081125] [2024-10-31 22:17:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:22,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:22,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:22,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:22,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:17:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:17:22,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-31 22:17:22,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:22,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197081125] [2024-10-31 22:17:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197081125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:22,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:22,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:22,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632337898] [2024-10-31 22:17:22,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:23,001 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:23,053 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-10-31 22:17:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-31 22:17:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:23,067 INFO L225 Difference]: With dead ends: 221 [2024-10-31 22:17:23,067 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:17:23,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:23,077 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:23,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:17:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-31 22:17:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-10-31 22:17:23,125 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-10-31 22:17:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:23,126 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-10-31 22:17:23,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-10-31 22:17:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:23,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:23,130 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:23,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:17:23,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:23,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 835025800, now seen corresponding path program 1 times [2024-10-31 22:17:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:23,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91868145] [2024-10-31 22:17:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:23,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:23,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:23,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:17:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:17:24,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-31 22:17:24,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:24,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91868145] [2024-10-31 22:17:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91868145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704959719] [2024-10-31 22:17:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:24,256 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:24,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:24,365 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-31 22:17:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:24,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-31 22:17:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:24,368 INFO L225 Difference]: With dead ends: 219 [2024-10-31 22:17:24,368 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:17:24,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:24,374 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:24,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:24,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:17:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:17:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-10-31 22:17:24,397 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2024-10-31 22:17:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-10-31 22:17:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-31 22:17:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-10-31 22:17:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:24,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:24,408 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:24,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-31 22:17:24,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:24,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:24,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1783077766, now seen corresponding path program 1 times [2024-10-31 22:17:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543367192] [2024-10-31 22:17:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:24,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:24,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-31 22:17:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:25,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:17:25,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:25,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:25,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543367192] [2024-10-31 22:17:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543367192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338692218] [2024-10-31 22:17:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:25,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:25,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:25,415 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:25,512 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-10-31 22:17:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-31 22:17:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:25,518 INFO L225 Difference]: With dead ends: 224 [2024-10-31 22:17:25,518 INFO L226 Difference]: Without dead ends: 115 [2024-10-31 22:17:25,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:25,521 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:25,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-31 22:17:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-31 22:17:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-31 22:17:25,542 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 146 [2024-10-31 22:17:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-31 22:17:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-31 22:17:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:17:25,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:25,549 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:25,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-31 22:17:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:25,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1733707370, now seen corresponding path program 1 times [2024-10-31 22:17:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:25,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650587639] [2024-10-31 22:17:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:25,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:25,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-31 22:17:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:26,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:17:26,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:26,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:26,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650587639] [2024-10-31 22:17:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650587639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:26,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745048856] [2024-10-31 22:17:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:26,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:26,462 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:26,539 INFO L93 Difference]: Finished difference Result 230 states and 331 transitions. [2024-10-31 22:17:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-31 22:17:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:26,545 INFO L225 Difference]: With dead ends: 230 [2024-10-31 22:17:26,545 INFO L226 Difference]: Without dead ends: 118 [2024-10-31 22:17:26,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:26,551 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:26,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-31 22:17:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-31 22:17:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-10-31 22:17:26,570 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2024-10-31 22:17:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-10-31 22:17:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-10-31 22:17:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:26,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:26,575 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:26,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-31 22:17:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:26,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -861623189, now seen corresponding path program 1 times [2024-10-31 22:17:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168413418] [2024-10-31 22:17:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:26,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:26,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:26,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-31 22:17:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:17:27,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:27,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:27,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168413418] [2024-10-31 22:17:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168413418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031538595] [2024-10-31 22:17:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:27,593 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:27,689 INFO L93 Difference]: Finished difference Result 234 states and 336 transitions. [2024-10-31 22:17:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:27,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:27,691 INFO L225 Difference]: With dead ends: 234 [2024-10-31 22:17:27,691 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 22:17:27,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:27,693 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:27,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 22:17:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-10-31 22:17:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-10-31 22:17:27,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2024-10-31 22:17:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:27,715 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-10-31 22:17:27,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-10-31 22:17:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:27,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:27,719 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:27,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-31 22:17:27,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:27,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:27,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -160558611, now seen corresponding path program 1 times [2024-10-31 22:17:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255382400] [2024-10-31 22:17:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:27,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:27,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:27,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:27,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-31 22:17:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:28,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:17:28,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:28,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:28,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255382400] [2024-10-31 22:17:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255382400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:17:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298377099] [2024-10-31 22:17:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:17:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:17:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:28,731 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:29,173 INFO L93 Difference]: Finished difference Result 242 states and 344 transitions. [2024-10-31 22:17:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:17:29,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:29,177 INFO L225 Difference]: With dead ends: 242 [2024-10-31 22:17:29,177 INFO L226 Difference]: Without dead ends: 125 [2024-10-31 22:17:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:29,179 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:29,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:17:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-31 22:17:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-10-31 22:17:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2024-10-31 22:17:29,189 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2024-10-31 22:17:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2024-10-31 22:17:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2024-10-31 22:17:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:29,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:29,193 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:29,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-31 22:17:29,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:29,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1614448751, now seen corresponding path program 1 times [2024-10-31 22:17:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364299137] [2024-10-31 22:17:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:29,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:29,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:29,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-31 22:17:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-31 22:17:30,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-31 22:17:30,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:30,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364299137] [2024-10-31 22:17:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364299137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:30,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:30,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:17:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332096979] [2024-10-31 22:17:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:17:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:17:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:17:30,231 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:30,720 INFO L93 Difference]: Finished difference Result 248 states and 349 transitions. [2024-10-31 22:17:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:17:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-10-31 22:17:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:30,726 INFO L225 Difference]: With dead ends: 248 [2024-10-31 22:17:30,726 INFO L226 Difference]: Without dead ends: 127 [2024-10-31 22:17:30,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:17:30,728 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:30,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:17:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-31 22:17:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-10-31 22:17:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-31 22:17:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 176 transitions. [2024-10-31 22:17:30,738 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 176 transitions. Word has length 148 [2024-10-31 22:17:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 176 transitions. [2024-10-31 22:17:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-31 22:17:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 176 transitions. [2024-10-31 22:17:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 22:17:30,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:30,741 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:30,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-31 22:17:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:30,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1616295793, now seen corresponding path program 1 times [2024-10-31 22:17:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293079127] [2024-10-31 22:17:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:30,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:17:30,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:30,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:17:30,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e596102d-ba50-4277-9404-2c341a9e4bb2/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-31 22:17:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:31,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-31 22:17:31,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:31,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:17:31,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-10-31 22:17:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-31 22:17:31,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:31,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:31,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293079127] [2024-10-31 22:17:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293079127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229117539] [2024-10-31 22:17:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:31,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:31,902 INFO L87 Difference]: Start difference. First operand 126 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)