./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ --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 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:34:48,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:34:48,478 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:34:48,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:34:48,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:34:48,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:34:48,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:34:48,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:34:48,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:34:48,515 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:34:48,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:34:48,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:34:48,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:34:48,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:34:48,518 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:34:48,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:34:48,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:34:48,519 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:34:48,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:34:48,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:34:48,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:34:48,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:34:48,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:34:48,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:34:48,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:34:48,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:34:48,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:34:48,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:34:48,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:34:48,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:34:48,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:34:48,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:34:48,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:34:48,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:34:48,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:34:48,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:34:48,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:34:48,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:34:48,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:34:48,529 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:34:48,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:34:48,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:34:48,530 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ 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 -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2023-11-23 22:34:48,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:34:48,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:34:48,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:34:48,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:34:48,855 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:34:48,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:34:51,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:34:52,262 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:34:52,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:34:52,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/29a5a53fb/c718b60d162e455ea8d3f75c8ed2c836/FLAG99f975cb4 [2023-11-23 22:34:52,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/29a5a53fb/c718b60d162e455ea8d3f75c8ed2c836 [2023-11-23 22:34:52,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:34:52,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:34:52,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:34:52,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:34:52,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:34:52,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16323975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52, skipping insertion in model container [2023-11-23 22:34:52,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:34:52,526 WARN L240 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-23 22:34:52,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:34:52,608 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:34:52,620 WARN L240 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-23 22:34:52,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:34:52,696 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:34:52,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52 WrapperNode [2023-11-23 22:34:52,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:34:52,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:34:52,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:34:52,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:34:52,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,817 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-11-23 22:34:52,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:34:52,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:34:52,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:34:52,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:34:52,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,849 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,894 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:34:52,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:34:52,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:34:52,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:34:52,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:34:52,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (1/1) ... [2023-11-23 22:34:52,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:34:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:34:52,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:34:52,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:34:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:34:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:34:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:34:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:34:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:34:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:34:53,093 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:34:53,096 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:34:53,446 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:34:53,540 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:34:53,549 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:34:53,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:53 BoogieIcfgContainer [2023-11-23 22:34:53,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:34:53,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:34:53,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:34:53,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:34:53,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:52" (1/3) ... [2023-11-23 22:34:53,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97c6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:53, skipping insertion in model container [2023-11-23 22:34:53,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:52" (2/3) ... [2023-11-23 22:34:53,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97c6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:53, skipping insertion in model container [2023-11-23 22:34:53,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:53" (3/3) ... [2023-11-23 22:34:53,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:34:53,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:34:53,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:34:53,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:34:53,646 INFO L357 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, mHoare=true, 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;@3f47ef67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:34:53,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:34:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 22:34:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-23 22:34:53,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:53,668 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:53,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:53,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1138637589, now seen corresponding path program 1 times [2023-11-23 22:34:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015225805] [2023-11-23 22:34:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:34:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015225805] [2023-11-23 22:34:54,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015225805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:34:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204919220] [2023-11-23 22:34:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:54,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:34:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:34:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:34:54,194 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:34:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:54,246 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2023-11-23 22:34:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:34:54,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2023-11-23 22:34:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:54,258 INFO L225 Difference]: With dead ends: 119 [2023-11-23 22:34:54,259 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 22:34:54,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:34:54,268 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:54,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:34:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 22:34:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 22:34:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 22:34:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-11-23 22:34:54,325 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 131 [2023-11-23 22:34:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:54,345 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-11-23 22:34:54,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:34:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-11-23 22:34:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-23 22:34:54,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:54,351 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:54,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:34:54,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:54,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 395082289, now seen corresponding path program 1 times [2023-11-23 22:34:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516783233] [2023-11-23 22:34:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:34:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516783233] [2023-11-23 22:34:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516783233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:55,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:34:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663576638] [2023-11-23 22:34:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:55,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:34:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:55,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:34:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:34:55,168 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:55,392 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2023-11-23 22:34:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:34:55,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-11-23 22:34:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:55,396 INFO L225 Difference]: With dead ends: 176 [2023-11-23 22:34:55,396 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 22:34:55,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:34:55,400 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:55,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 252 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:34:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 22:34:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2023-11-23 22:34:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-23 22:34:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2023-11-23 22:34:55,455 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 131 [2023-11-23 22:34:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:55,458 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2023-11-23 22:34:55,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2023-11-23 22:34:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 22:34:55,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:55,464 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:55,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:34:55,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:55,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -610856372, now seen corresponding path program 1 times [2023-11-23 22:34:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937597491] [2023-11-23 22:34:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:34:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937597491] [2023-11-23 22:34:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937597491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:34:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204171134] [2023-11-23 22:34:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:55,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:34:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:34:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:34:55,982 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:56,229 INFO L93 Difference]: Finished difference Result 220 states and 336 transitions. [2023-11-23 22:34:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:34:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2023-11-23 22:34:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:56,233 INFO L225 Difference]: With dead ends: 220 [2023-11-23 22:34:56,233 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 22:34:56,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:34:56,236 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 98 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:56,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 303 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:34:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 22:34:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2023-11-23 22:34:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-23 22:34:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2023-11-23 22:34:56,289 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 132 [2023-11-23 22:34:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:56,303 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2023-11-23 22:34:56,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2023-11-23 22:34:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-23 22:34:56,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:56,314 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:34:56,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:56,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 614792216, now seen corresponding path program 1 times [2023-11-23 22:34:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:56,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229387641] [2023-11-23 22:34:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:34:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229387641] [2023-11-23 22:34:56,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229387641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:56,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:34:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065211811] [2023-11-23 22:34:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:56,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:34:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:34:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:34:56,728 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:34:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:57,013 INFO L93 Difference]: Finished difference Result 382 states and 594 transitions. [2023-11-23 22:34:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:34:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2023-11-23 22:34:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:57,022 INFO L225 Difference]: With dead ends: 382 [2023-11-23 22:34:57,022 INFO L226 Difference]: Without dead ends: 268 [2023-11-23 22:34:57,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:34:57,038 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:57,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:34:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-23 22:34:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2023-11-23 22:34:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.3096774193548386) internal successors, (203), 155 states have internal predecessors, (203), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-23 22:34:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 413 transitions. [2023-11-23 22:34:57,148 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 413 transitions. Word has length 133 [2023-11-23 22:34:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:57,149 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 413 transitions. [2023-11-23 22:34:57,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:34:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 413 transitions. [2023-11-23 22:34:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-23 22:34:57,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:57,152 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:57,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:34:57,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:57,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1294850586, now seen corresponding path program 1 times [2023-11-23 22:34:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983282708] [2023-11-23 22:34:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:34:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983282708] [2023-11-23 22:34:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983282708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:34:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:34:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:34:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835849547] [2023-11-23 22:34:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:34:57,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:34:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:57,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:34:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:34:57,451 INFO L87 Difference]: Start difference. First operand 266 states and 413 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:57,521 INFO L93 Difference]: Finished difference Result 492 states and 766 transitions. [2023-11-23 22:34:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:34:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2023-11-23 22:34:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:57,525 INFO L225 Difference]: With dead ends: 492 [2023-11-23 22:34:57,525 INFO L226 Difference]: Without dead ends: 266 [2023-11-23 22:34:57,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:34:57,528 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:57,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 148 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:34:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-23 22:34:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-23 22:34:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-23 22:34:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2023-11-23 22:34:57,585 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 133 [2023-11-23 22:34:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:57,586 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2023-11-23 22:34:57,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:34:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2023-11-23 22:34:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-23 22:34:57,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:57,588 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:57,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:34:57,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:57,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013257, now seen corresponding path program 1 times [2023-11-23 22:34:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920247655] [2023-11-23 22:34:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-23 22:34:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920247655] [2023-11-23 22:34:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920247655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:34:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851670785] [2023-11-23 22:34:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:57,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:34:57,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:34:57,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:34:57,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:34:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:58,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:34:58,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:34:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-11-23 22:34:58,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:34:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-23 22:34:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851670785] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:34:58,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:34:58,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-23 22:34:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131177793] [2023-11-23 22:34:58,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:34:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:34:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:34:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:34:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:34:58,485 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-23 22:34:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:34:58,706 INFO L93 Difference]: Finished difference Result 410 states and 610 transitions. [2023-11-23 22:34:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:34:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 134 [2023-11-23 22:34:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:34:58,710 INFO L225 Difference]: With dead ends: 410 [2023-11-23 22:34:58,710 INFO L226 Difference]: Without dead ends: 296 [2023-11-23 22:34:58,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-23 22:34:58,712 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:34:58,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 133 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:34:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-23 22:34:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 166. [2023-11-23 22:34:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-23 22:34:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 243 transitions. [2023-11-23 22:34:58,772 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 243 transitions. Word has length 134 [2023-11-23 22:34:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:34:58,773 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 243 transitions. [2023-11-23 22:34:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-23 22:34:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2023-11-23 22:34:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-23 22:34:58,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:34:58,776 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:34:58,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:34:58,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:34:58,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:34:58,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:34:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -573954887, now seen corresponding path program 1 times [2023-11-23 22:34:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:34:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566937526] [2023-11-23 22:34:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:34:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:34:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:34:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:34:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:34:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 22:34:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:34:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:34:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 22:34:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 22:34:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:34:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 22:34:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 22:34:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 22:34:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 22:34:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:34:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 22:34:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:34:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 22:34:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:34:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:34:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 22:34:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-23 22:34:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:34:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566937526] [2023-11-23 22:34:59,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566937526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:34:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440739666] [2023-11-23 22:34:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:34:59,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:34:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:34:59,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:34:59,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:34:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:34:59,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 22:34:59,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:34:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-11-23 22:34:59,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:35:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-23 22:35:00,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440739666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:35:00,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:35:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 9 [2023-11-23 22:35:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121254188] [2023-11-23 22:35:00,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:35:00,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:35:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:35:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:35:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:35:00,202 INFO L87 Difference]: Start difference. First operand 166 states and 243 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-23 22:35:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:00,886 INFO L93 Difference]: Finished difference Result 338 states and 477 transitions. [2023-11-23 22:35:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 22:35:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 134 [2023-11-23 22:35:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:00,889 INFO L225 Difference]: With dead ends: 338 [2023-11-23 22:35:00,890 INFO L226 Difference]: Without dead ends: 276 [2023-11-23 22:35:00,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2023-11-23 22:35:00,891 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 194 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:00,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 397 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:35:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-23 22:35:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 184. [2023-11-23 22:35:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-23 22:35:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2023-11-23 22:35:00,960 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 134 [2023-11-23 22:35:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:00,960 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2023-11-23 22:35:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-23 22:35:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2023-11-23 22:35:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-23 22:35:00,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:00,963 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:00,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:35:01,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:35:01,185 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:01,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -613111839, now seen corresponding path program 1 times [2023-11-23 22:35:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:35:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222764642] [2023-11-23 22:35:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:35:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:35:01,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:35:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:35:01,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:35:01,486 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:35:01,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:35:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:35:01,495 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:01,500 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:35:01,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:35:01 BoogieIcfgContainer [2023-11-23 22:35:01,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:35:01,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:35:01,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:35:01,632 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:35:01,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:53" (3/4) ... [2023-11-23 22:35:01,635 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:35:01,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:35:01,637 INFO L158 Benchmark]: Toolchain (without parser) took 9342.32ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 103.0MB in the beginning and 159.5MB in the end (delta: -56.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,638 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:35:01,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.31ms. Allocated memory is still 155.2MB. Free memory was 102.7MB in the beginning and 89.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.14ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 125.3MB in the end (delta: -36.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,639 INFO L158 Benchmark]: Boogie Preprocessor took 106.15ms. Allocated memory is still 155.2MB. Free memory was 125.3MB in the beginning and 121.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,639 INFO L158 Benchmark]: RCFGBuilder took 626.17ms. Allocated memory is still 155.2MB. Free memory was 121.3MB in the beginning and 100.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,640 INFO L158 Benchmark]: TraceAbstraction took 8077.41ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 99.6MB in the beginning and 159.5MB in the end (delta: -59.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-11-23 22:35:01,640 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 224.4MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:35:01,642 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.32ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.31ms. Allocated memory is still 155.2MB. Free memory was 102.7MB in the beginning and 89.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.14ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 125.3MB in the end (delta: -36.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.15ms. Allocated memory is still 155.2MB. Free memory was 125.3MB in the beginning and 121.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 626.17ms. Allocated memory is still 155.2MB. Free memory was 121.3MB in the beginning and 100.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8077.41ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 99.6MB in the beginning and 159.5MB in the end (delta: -59.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 224.4MB. Free memory is still 159.5MB. 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 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=-10, var_1_9=126] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=0, stepLocal_4=128, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=0, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 522 mSDsluCounter, 1556 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 961 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 595 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 854 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 252 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2963 SizeOfPredicates, 9 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 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 [2023-11-23 22:35:01,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ --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 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:35:04,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:35:04,440 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 22:35:04,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:35:04,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:35:04,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:35:04,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:35:04,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:35:04,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:35:04,500 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:35:04,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:35:04,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:35:04,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:35:04,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:35:04,505 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:35:04,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:35:04,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:35:04,506 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:35:04,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:35:04,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:35:04,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:35:04,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:35:04,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:35:04,510 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:35:04,510 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 22:35:04,511 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 22:35:04,511 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:35:04,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:35:04,512 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:35:04,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:35:04,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:35:04,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:35:04,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:35:04,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:35:04,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:35:04,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:35:04,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:35:04,517 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 22:35:04,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 22:35:04,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:35:04,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:35:04,518 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:35:04,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:35:04,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:35:04,519 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 22:35:04,528 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ 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 -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2023-11-23 22:35:04,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:35:04,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:35:04,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:35:04,926 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:35:04,927 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:35:04,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:35:08,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:35:08,437 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:35:08,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:35:08,452 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/e48eac7ec/54864d96dbbc4b918524a55c89306a8f/FLAG2775b3410 [2023-11-23 22:35:08,469 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/data/e48eac7ec/54864d96dbbc4b918524a55c89306a8f [2023-11-23 22:35:08,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:35:08,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:35:08,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:35:08,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:35:08,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:35:08,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:08,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2ef449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08, skipping insertion in model container [2023-11-23 22:35:08,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:08,515 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:35:08,678 WARN L240 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-23 22:35:08,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:35:08,828 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:35:08,848 WARN L240 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_3d96484f-39ea-43fc-9052-1ebb3dac097c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-23 22:35:08,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:35:08,938 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:35:08,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08 WrapperNode [2023-11-23 22:35:08,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:35:08,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:35:08,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:35:08,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:35:08,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:08,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,024 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-11-23 22:35:09,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:35:09,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:35:09,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:35:09,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:35:09,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,057 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,081 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:35:09,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:35:09,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:35:09,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:35:09,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:35:09,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (1/1) ... [2023-11-23 22:35:09,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:35:09,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:35:09,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:35:09,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:35:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:35:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 22:35:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:35:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:35:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:35:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:35:09,383 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:35:09,385 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:35:16,220 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:35:16,282 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:35:16,283 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:35:16,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:16 BoogieIcfgContainer [2023-11-23 22:35:16,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:35:16,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:35:16,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:35:16,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:35:16,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:08" (1/3) ... [2023-11-23 22:35:16,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5c743a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:16, skipping insertion in model container [2023-11-23 22:35:16,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:08" (2/3) ... [2023-11-23 22:35:16,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5c743a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:16, skipping insertion in model container [2023-11-23 22:35:16,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:16" (3/3) ... [2023-11-23 22:35:16,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-23 22:35:16,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:35:16,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:35:16,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:35:16,391 INFO L357 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, mHoare=true, 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;@37305969, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:35:16,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:35:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 22:35:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-23 22:35:16,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:16,418 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:16,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:16,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1138637589, now seen corresponding path program 1 times [2023-11-23 22:35:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:35:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248906805] [2023-11-23 22:35:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:16,446 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 [2023-11-23 22:35:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:35:16,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 22:35:16,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:17,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 22:35:17,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:35:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-11-23 22:35:17,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:35:17,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:35:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248906805] [2023-11-23 22:35:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248906805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:17,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:35:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542093934] [2023-11-23 22:35:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:17,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:35:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:35:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:35:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:35:17,642 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:35:19,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:19,906 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2023-11-23 22:35:19,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:35:19,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2023-11-23 22:35:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:19,997 INFO L225 Difference]: With dead ends: 119 [2023-11-23 22:35:19,998 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 22:35:20,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:35:20,008 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:20,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 22:35:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 22:35:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 22:35:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-23 22:35:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-11-23 22:35:20,072 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 131 [2023-11-23 22:35:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:20,073 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-11-23 22:35:20,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-23 22:35:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-11-23 22:35:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-23 22:35:20,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:20,078 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:20,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:20,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:20,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:20,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 395082289, now seen corresponding path program 1 times [2023-11-23 22:35:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:35:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135239539] [2023-11-23 22:35:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:20,299 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 [2023-11-23 22:35:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:35:20,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 22:35:20,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:21,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:35:21,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:35:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:35:23,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:35:23,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:35:23,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135239539] [2023-11-23 22:35:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135239539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:35:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575899304] [2023-11-23 22:35:23,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:23,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:35:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:35:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:35:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:35:23,499 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:35:25,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:28,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:30,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:32,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:34,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:37,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:39,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:35:39,008 INFO L93 Difference]: Finished difference Result 176 states and 272 transitions. [2023-11-23 22:35:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:35:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-11-23 22:35:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:35:39,095 INFO L225 Difference]: With dead ends: 176 [2023-11-23 22:35:39,095 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 22:35:39,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:35:39,098 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 43 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:35:39,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 15.4s Time] [2023-11-23 22:35:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 22:35:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2023-11-23 22:35:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-23 22:35:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 150 transitions. [2023-11-23 22:35:39,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 150 transitions. Word has length 131 [2023-11-23 22:35:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:35:39,159 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 150 transitions. [2023-11-23 22:35:39,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:35:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2023-11-23 22:35:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 22:35:39,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:35:39,165 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:35:39,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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)] Forceful destruction successful, exit code 0 [2023-11-23 22:35:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:39,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:35:39,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:35:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash -610856372, now seen corresponding path program 1 times [2023-11-23 22:35:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:35:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338613310] [2023-11-23 22:35:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:35:39,381 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 [2023-11-23 22:35:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:35:39,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 22:35:39,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d96484f-39ea-43fc-9052-1ebb3dac097c/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 22:35:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:35:40,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:35:40,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:35:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-23 22:35:42,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:35:42,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:35:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338613310] [2023-11-23 22:35:42,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338613310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:35:42,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:35:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:35:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545717326] [2023-11-23 22:35:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:35:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:35:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:35:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:35:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:35:42,614 INFO L87 Difference]: Start difference. First operand 98 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 22:35:45,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 22:35:47,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []