./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX --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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:16:50,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:16:50,463 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:16:50,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:16:50,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:16:50,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:16:50,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:16:50,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:16:50,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:16:50,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:16:50,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:16:50,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:16:50,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:16:50,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:16:50,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:16:50,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:16:50,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:16:50,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:16:50,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:16:50,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:16:50,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:16:50,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:16:50,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:16:50,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:16:50,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:16:50,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:16:50,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:16:50,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:16:50,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:16:50,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:16:50,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:16:50,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:16:50,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:16:50,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:16:50,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:16:50,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:16:50,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:16:50,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:16:50,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:16:50,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:16:50,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:16:50,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:16:50,546 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-08 17:16:50,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:16:50,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:16:50,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:16:50,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:16:50,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:16:50,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i Unable to find full path for "g++" [2024-11-08 17:16:53,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:16:53,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:16:53,556 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 17:16:53,568 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/97d086a20/235fdbd9d88d48bfa59888cbc400d430/FLAG927290213 [2024-11-08 17:16:53,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/97d086a20/235fdbd9d88d48bfa59888cbc400d430 [2024-11-08 17:16:53,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:16:53,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:16:53,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:16:53,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:16:53,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:16:53,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:16:53" (1/1) ... [2024-11-08 17:16:53,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e097c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:53, skipping insertion in model container [2024-11-08 17:16:53,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:16:53" (1/1) ... [2024-11-08 17:16:53,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:16:53,877 WARN L250 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-08 17:16:53,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:16:53,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:16:54,010 WARN L250 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-08 17:16:54,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:16:54,083 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:16:54,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54 WrapperNode [2024-11-08 17:16:54,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:16:54,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:16:54,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:16:54,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:16:54,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,152 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-08 17:16:54,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:16:54,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:16:54,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:16:54,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:16:54,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:16:54,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:16:54,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:16:54,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:16:54,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:16:54,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (1/1) ... [2024-11-08 17:16:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:16:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:16:54,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:16:54,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:16:54,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:16:54,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:16:54,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:16:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:16:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:16:54,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:16:54,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:16:54,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:16:55,048 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 17:16:55,049 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:16:55,073 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:16:55,077 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:16:55,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:16:55 BoogieIcfgContainer [2024-11-08 17:16:55,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:16:55,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:16:55,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:16:55,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:16:55,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:16:53" (1/3) ... [2024-11-08 17:16:55,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:16:55, skipping insertion in model container [2024-11-08 17:16:55,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:16:54" (2/3) ... [2024-11-08 17:16:55,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7859090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:16:55, skipping insertion in model container [2024-11-08 17:16:55,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:16:55" (3/3) ... [2024-11-08 17:16:55,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 17:16:55,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:16:55,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:16:55,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:16:55,172 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27298e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:16:55,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:16:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:16:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:16:55,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:55,191 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:55,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:55,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1042608584, now seen corresponding path program 1 times [2024-11-08 17:16:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975033006] [2024-11-08 17:16:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:16:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:16:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:16:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:16:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:16:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:16:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:16:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:16:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:16:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:16:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:16:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:16:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:16:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:16:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:16:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:16:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:16:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:16:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:16:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:16:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975033006] [2024-11-08 17:16:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975033006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:55,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:16:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236687107] [2024-11-08 17:16:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:16:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:16:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:16:55,922 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 17:16:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:55,975 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2024-11-08 17:16:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:16:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-11-08 17:16:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:55,990 INFO L225 Difference]: With dead ends: 155 [2024-11-08 17:16:55,991 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 17:16:55,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:16:56,001 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:56,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 17:16:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 17:16:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:16:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 17:16:56,088 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 145 [2024-11-08 17:16:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 17:16:56,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 17:16:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 17:16:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:16:56,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:56,101 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:56,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:16:56,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:56,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1890679928, now seen corresponding path program 1 times [2024-11-08 17:16:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:56,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057020444] [2024-11-08 17:16:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:16:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:16:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:16:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:16:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:16:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:16:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:16:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:16:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:16:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:16:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:16:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:16:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:16:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:16:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:16:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:16:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:16:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:16:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:16:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:16:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057020444] [2024-11-08 17:16:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057020444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:16:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887237172] [2024-11-08 17:16:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:16:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:16:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:16:56,991 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:16:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:57,046 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-08 17:16:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:16:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 17:16:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:57,054 INFO L225 Difference]: With dead ends: 151 [2024-11-08 17:16:57,055 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 17:16:57,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:16:57,059 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:57,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 17:16:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 17:16:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:16:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-08 17:16:57,091 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 145 [2024-11-08 17:16:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-08 17:16:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:16:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-08 17:16:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:16:57,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:57,102 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:57,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:16:57,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2146121930, now seen corresponding path program 1 times [2024-11-08 17:16:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206970705] [2024-11-08 17:16:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206970705] [2024-11-08 17:17:02,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206970705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:02,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:02,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:17:02,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27032197] [2024-11-08 17:17:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:02,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:17:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:17:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:17:02,737 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:05,096 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2024-11-08 17:17:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:17:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 17:17:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:05,103 INFO L225 Difference]: With dead ends: 186 [2024-11-08 17:17:05,103 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 17:17:05,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:17:05,105 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:05,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 395 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:17:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 17:17:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-08 17:17:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.325) internal successors, (106), 81 states have internal predecessors, (106), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:17:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-08 17:17:05,149 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 145 [2024-11-08 17:17:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:05,150 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-08 17:17:05,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-08 17:17:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:17:05,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:05,156 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:05,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:17:05,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:05,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1733017039, now seen corresponding path program 1 times [2024-11-08 17:17:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418447951] [2024-11-08 17:17:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:06,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418447951] [2024-11-08 17:17:06,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418447951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:06,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:17:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256838332] [2024-11-08 17:17:06,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:17:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:17:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:17:06,936 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:07,389 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2024-11-08 17:17:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:17:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 17:17:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:07,399 INFO L225 Difference]: With dead ends: 247 [2024-11-08 17:17:07,399 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 17:17:07,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:17:07,403 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:07,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:17:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 17:17:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-08 17:17:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.320754716981132) internal successors, (140), 108 states have internal predecessors, (140), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:17:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-08 17:17:07,446 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 146 [2024-11-08 17:17:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:07,451 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-08 17:17:07,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-08 17:17:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:17:07,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:07,454 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:07,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:17:07,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:07,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 721899789, now seen corresponding path program 1 times [2024-11-08 17:17:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:07,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101226471] [2024-11-08 17:17:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:07,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101226471] [2024-11-08 17:17:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101226471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:17:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38650753] [2024-11-08 17:17:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:08,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:17:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:17:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:17:08,492 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:08,952 INFO L93 Difference]: Finished difference Result 289 states and 404 transitions. [2024-11-08 17:17:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:17:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 17:17:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:08,958 INFO L225 Difference]: With dead ends: 289 [2024-11-08 17:17:08,961 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 17:17:08,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:17:08,963 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:08,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:17:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 17:17:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-11-08 17:17:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 90 states have internal predecessors, (113), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:17:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-08 17:17:09,011 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 146 [2024-11-08 17:17:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:09,013 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-08 17:17:09,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-08 17:17:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 17:17:09,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:09,018 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:09,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:17:09,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1048037647, now seen corresponding path program 1 times [2024-11-08 17:17:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:09,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382641940] [2024-11-08 17:17:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382641940] [2024-11-08 17:17:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382641940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:17:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239914864] [2024-11-08 17:17:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:16,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:17:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:16,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:17:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:17:16,566 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:18,776 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-11-08 17:17:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:17:18,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-08 17:17:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:18,780 INFO L225 Difference]: With dead ends: 328 [2024-11-08 17:17:18,780 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 17:17:18,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:17:18,784 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:18,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 554 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:17:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 17:17:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2024-11-08 17:17:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:17:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 17:17:18,833 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 17:17:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:18,834 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 17:17:18,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 17:17:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 17:17:18,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:18,840 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:18,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:17:18,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash -346973069, now seen corresponding path program 1 times [2024-11-08 17:17:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:18,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048202090] [2024-11-08 17:17:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048202090] [2024-11-08 17:17:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048202090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:17:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415120837] [2024-11-08 17:17:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:17:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:17:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:17:26,260 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:28,433 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-11-08 17:17:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:17:28,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-08 17:17:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:28,437 INFO L225 Difference]: With dead ends: 365 [2024-11-08 17:17:28,437 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 17:17:28,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:17:28,439 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:28,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 676 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:17:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 17:17:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2024-11-08 17:17:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:17:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 17:17:28,464 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 17:17:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:28,465 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 17:17:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 17:17:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:17:28,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:28,468 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:28,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:17:28,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1640736242, now seen corresponding path program 1 times [2024-11-08 17:17:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787091994] [2024-11-08 17:17:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:28,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787091994] [2024-11-08 17:17:28,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787091994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:28,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:28,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:17:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620301731] [2024-11-08 17:17:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:28,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:17:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:17:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:28,626 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:28,793 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2024-11-08 17:17:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:17:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 17:17:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:28,795 INFO L225 Difference]: With dead ends: 360 [2024-11-08 17:17:28,796 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 17:17:28,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:28,799 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:28,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:17:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 17:17:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2024-11-08 17:17:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 157 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:17:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2024-11-08 17:17:28,834 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2024-11-08 17:17:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:28,836 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2024-11-08 17:17:28,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2024-11-08 17:17:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:17:28,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:28,842 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:28,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:17:28,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:28,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash -7331156, now seen corresponding path program 1 times [2024-11-08 17:17:28,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:28,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810661860] [2024-11-08 17:17:28,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:29,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:29,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810661860] [2024-11-08 17:17:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810661860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:29,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:17:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31940028] [2024-11-08 17:17:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:29,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:17:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:17:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:17:29,274 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:29,534 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2024-11-08 17:17:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:17:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 17:17:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:29,539 INFO L225 Difference]: With dead ends: 521 [2024-11-08 17:17:29,539 INFO L226 Difference]: Without dead ends: 336 [2024-11-08 17:17:29,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:17:29,541 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 88 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:29,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 383 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:17:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-08 17:17:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2024-11-08 17:17:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.2808988764044944) internal successors, (228), 180 states have internal predecessors, (228), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 17:17:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2024-11-08 17:17:29,611 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 148 [2024-11-08 17:17:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:29,612 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2024-11-08 17:17:29,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-08 17:17:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:17:29,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:29,617 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:29,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:17:29,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 625477210, now seen corresponding path program 1 times [2024-11-08 17:17:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126910455] [2024-11-08 17:17:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:17:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:17:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:17:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:17:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:17:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:17:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:17:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:17:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:17:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:17:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:17:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:17:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 17:17:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:17:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:17:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:17:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 17:17:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 17:17:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 17:17:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 17:17:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:17:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:17:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126910455] [2024-11-08 17:17:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126910455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:29,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:17:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586388620] [2024-11-08 17:17:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:29,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:17:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:17:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:29,788 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:29,951 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2024-11-08 17:17:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:17:29,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 17:17:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:29,955 INFO L225 Difference]: With dead ends: 448 [2024-11-08 17:17:29,957 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 17:17:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:29,958 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:29,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:17:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 17:17:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2024-11-08 17:17:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 166 states have internal predecessors, (209), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 17:17:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-11-08 17:17:29,997 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 148 [2024-11-08 17:17:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:29,998 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-11-08 17:17:29,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-11-08 17:17:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:17:30,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:30,000 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:30,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:17:30,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1318984876, now seen corresponding path program 1 times [2024-11-08 17:17:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845811757] [2024-11-08 17:17:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:17:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019958797] [2024-11-08 17:17:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:30,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:17:30,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:30,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:17:30,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:17:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:17:30,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:17:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:17:30,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:17:30,686 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:17:30,688 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:17:30,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:17:30,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 17:17:30,895 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:31,021 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:17:31,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:17:31 BoogieIcfgContainer [2024-11-08 17:17:31,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:17:31,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:17:31,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:17:31,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:17:31,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:16:55" (3/4) ... [2024-11-08 17:17:31,030 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:17:31,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:17:31,032 INFO L158 Benchmark]: Toolchain (without parser) took 37433.47ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 133.9MB in the beginning and 157.2MB in the end (delta: -23.2MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,033 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 132.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:17:31,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.24ms. Allocated memory is still 176.2MB. Free memory was 133.4MB in the beginning and 117.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.43ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 114.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,034 INFO L158 Benchmark]: Boogie Preprocessor took 90.28ms. Allocated memory is still 176.2MB. Free memory was 114.0MB in the beginning and 109.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,034 INFO L158 Benchmark]: RCFGBuilder took 833.73ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 127.1MB in the end (delta: -17.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,035 INFO L158 Benchmark]: TraceAbstraction took 35944.52ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 126.1MB in the beginning and 157.2MB in the end (delta: -31.1MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. [2024-11-08 17:17:31,035 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 371.2MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:17:31,037 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.35ms. Allocated memory is still 132.1MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.24ms. Allocated memory is still 176.2MB. Free memory was 133.4MB in the beginning and 117.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.43ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 114.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.28ms. Allocated memory is still 176.2MB. Free memory was 114.0MB in the beginning and 109.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 833.73ms. Allocated memory is still 176.2MB. Free memory was 109.3MB in the beginning and 127.1MB in the end (delta: -17.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35944.52ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 126.1MB in the beginning and 157.2MB in the end (delta: -31.1MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 371.2MB. Free memory is still 157.2MB. 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 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3550 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1106 mSDtfsCounter, 1429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 54, 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, 10 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 1763 NumberOfCodeBlocks, 1763 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 6174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 9240/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 [2024-11-08 17:17:31,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX --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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:17:33,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:17:33,957 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:17:33,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:17:33,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:17:33,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:17:33,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:17:33,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:17:33,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:17:33,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:17:34,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:17:34,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:17:34,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:17:34,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:17:34,003 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:17:34,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:17:34,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:17:34,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:17:34,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:17:34,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:17:34,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:17:34,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:17:34,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:17:34,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:17:34,008 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:17:34,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:17:34,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:17:34,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:17:34,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:17:34,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:17:34,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:17:34,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:17:34,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:17:34,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:17:34,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:17:34,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:17:34,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:17:34,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:17:34,015 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:17:34,016 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:17:34,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:17:34,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:17:34,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:17:34,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:17:34,034 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-08 17:17:34,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:17:34,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:17:34,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:17:34,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:17:34,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:17:34,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i Unable to find full path for "g++" [2024-11-08 17:17:37,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:17:37,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:17:37,467 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 17:17:37,480 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/c747c2bb8/ea59652a73f446db8cbf178871b1969b/FLAGda21436bd [2024-11-08 17:17:37,507 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/data/c747c2bb8/ea59652a73f446db8cbf178871b1969b [2024-11-08 17:17:37,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:17:37,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:17:37,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:17:37,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:17:37,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:17:37,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:17:37" (1/1) ... [2024-11-08 17:17:37,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7857707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:37, skipping insertion in model container [2024-11-08 17:17:37,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:17:37" (1/1) ... [2024-11-08 17:17:37,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:17:37,859 WARN L250 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-08 17:17:37,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:17:38,003 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:17:38,019 WARN L250 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_28b7cbfa-03a9-4aec-84c4-70a135ae0884/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-08 17:17:38,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:17:38,112 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:17:38,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38 WrapperNode [2024-11-08 17:17:38,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:17:38,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:17:38,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:17:38,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:17:38,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,217 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-08 17:17:38,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:17:38,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:17:38,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:17:38,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:17:38,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:17:38,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:17:38,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:17:38,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:17:38,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:17:38,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (1/1) ... [2024-11-08 17:17:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:17:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:38,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:17:38,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:17:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:17:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:17:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:17:38,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:17:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:17:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:17:38,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:17:38,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:17:39,088 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 17:17:39,088 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:17:39,106 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:17:39,107 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:17:39,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:17:39 BoogieIcfgContainer [2024-11-08 17:17:39,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:17:39,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:17:39,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:17:39,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:17:39,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:17:37" (1/3) ... [2024-11-08 17:17:39,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b845e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:17:39, skipping insertion in model container [2024-11-08 17:17:39,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:38" (2/3) ... [2024-11-08 17:17:39,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b845e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:17:39, skipping insertion in model container [2024-11-08 17:17:39,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:17:39" (3/3) ... [2024-11-08 17:17:39,118 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 17:17:39,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:17:39,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:17:39,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:17:39,224 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@700ce4af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:17:39,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:17:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:17:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:17:39,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:39,248 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:39,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:39,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -271741642, now seen corresponding path program 1 times [2024-11-08 17:17:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:17:39,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553451363] [2024-11-08 17:17:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:17:39,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:17:39,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:17:39,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:17:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:39,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:17:39,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:17:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-08 17:17:39,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:17:39,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:17:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553451363] [2024-11-08 17:17:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553451363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:39,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:39,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:17:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125439529] [2024-11-08 17:17:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:17:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:17:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:17:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:17:39,810 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 17:17:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:39,864 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-08 17:17:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:17:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-08 17:17:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:39,880 INFO L225 Difference]: With dead ends: 119 [2024-11-08 17:17:39,880 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 17:17:39,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:17:39,891 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:39,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:17:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 17:17:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 17:17:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:17:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-08 17:17:39,951 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 139 [2024-11-08 17:17:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:39,952 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-08 17:17:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 17:17:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-08 17:17:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:17:39,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:39,957 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:39,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:17:40,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:17:40,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1654893430, now seen corresponding path program 1 times [2024-11-08 17:17:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:17:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799522301] [2024-11-08 17:17:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:17:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:17:40,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:17:40,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:17:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:40,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:17:40,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:17:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 17:17:40,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:17:40,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:17:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799522301] [2024-11-08 17:17:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799522301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:17:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208821315] [2024-11-08 17:17:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:17:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:17:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:17:40,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:40,606 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:40,721 INFO L93 Difference]: Finished difference Result 115 states and 173 transitions. [2024-11-08 17:17:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:17:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-08 17:17:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:40,734 INFO L225 Difference]: With dead ends: 115 [2024-11-08 17:17:40,735 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 17:17:40,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:40,740 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:17:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 17:17:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 17:17:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 17:17:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-08 17:17:40,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-08 17:17:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:40,778 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-08 17:17:40,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 17:17:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-08 17:17:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:17:40,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:40,784 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:17:40,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:17:40,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:17:40,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 845546804, now seen corresponding path program 1 times [2024-11-08 17:17:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:17:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328267469] [2024-11-08 17:17:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:40,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:17:40,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:17:40,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:17:40,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28b7cbfa-03a9-4aec-84c4-70a135ae0884/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:17:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:41,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 17:17:41,354 INFO L278 TraceCheckSpWp]: Computing forward predicates...