./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 ee2e1821328b1b054a61bc5eb26b8f9eaee46050974a9587636fea1af78a34a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:01:13,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:01:13,321 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:01:13,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:01:13,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:01:13,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:01:13,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:01:13,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:01:13,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:01:13,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:01:13,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:01:13,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:01:13,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:01:13,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:01:13,371 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:01:13,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:01:13,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:01:13,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:01:13,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:01:13,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:01:13,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:01:13,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:01:13,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:01:13,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:01:13,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:01:13,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:01:13,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:01:13,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:01:13,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:01:13,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:01:13,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:01:13,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:01:13,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:01:13,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:01:13,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:01:13,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:01:13,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:01:13,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:01:13,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:01:13,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:01:13,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:01:13,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:01:13,387 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 -> ee2e1821328b1b054a61bc5eb26b8f9eaee46050974a9587636fea1af78a34a8 [2024-11-08 19:01:13,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:01:13,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:01:13,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:01:13,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:01:13,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:01:13,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i Unable to find full path for "g++" [2024-11-08 19:01:16,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:01:16,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:01:16,539 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i [2024-11-08 19:01:16,558 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/b6c8c184b/26ef8d2c735340dfbf6a1d249ee731ae/FLAGce249c0ca [2024-11-08 19:01:16,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/b6c8c184b/26ef8d2c735340dfbf6a1d249ee731ae [2024-11-08 19:01:16,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:01:16,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:01:16,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:01:16,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:01:16,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:01:16,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:01:16" (1/1) ... [2024-11-08 19:01:16,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cc46f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:16, skipping insertion in model container [2024-11-08 19:01:16,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:01:16" (1/1) ... [2024-11-08 19:01:16,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:01:16,945 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i[919,932] [2024-11-08 19:01:17,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:01:17,149 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:01:17,166 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i[919,932] [2024-11-08 19:01:17,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:01:17,250 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:01:17,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17 WrapperNode [2024-11-08 19:01:17,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:01:17,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:01:17,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:01:17,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:01:17,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,383 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278 [2024-11-08 19:01:17,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:01:17,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:01:17,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:01:17,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:01:17,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,488 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 19:01:17,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:01:17,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:01:17,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:01:17,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:01:17,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (1/1) ... [2024-11-08 19:01:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:01:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:17,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:01:17,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:01:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:01:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:01:17,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:01:17,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:01:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:01:17,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:01:17,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:01:17,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:01:18,656 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 19:01:18,656 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:01:18,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:01:18,683 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:01:18,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:01:18 BoogieIcfgContainer [2024-11-08 19:01:18,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:01:18,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:01:18,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:01:18,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:01:18,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:01:16" (1/3) ... [2024-11-08 19:01:18,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0f8dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:01:18, skipping insertion in model container [2024-11-08 19:01:18,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:17" (2/3) ... [2024-11-08 19:01:18,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0f8dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:01:18, skipping insertion in model container [2024-11-08 19:01:18,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:01:18" (3/3) ... [2024-11-08 19:01:18,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i [2024-11-08 19:01:18,720 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:01:18,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:01:18,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:01:18,843 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;@4b10648e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:01:18,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:01:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 84 states have internal predecessors, (122), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:01:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:01:18,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:18,882 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:18,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash -523882678, now seen corresponding path program 1 times [2024-11-08 19:01:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:18,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655146338] [2024-11-08 19:01:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655146338] [2024-11-08 19:01:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655146338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:19,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:01:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314794513] [2024-11-08 19:01:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:01:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:19,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:01:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:01:19,736 INFO L87 Difference]: Start difference. First operand has 118 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 84 states have internal predecessors, (122), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:01:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:19,810 INFO L93 Difference]: Finished difference Result 229 states and 398 transitions. [2024-11-08 19:01:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:01:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-08 19:01:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:19,828 INFO L225 Difference]: With dead ends: 229 [2024-11-08 19:01:19,828 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 19:01:19,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 19:01:19,837 INFO L432 NwaCegarLoop]: 179 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, 179 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 19:01:19,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:01:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 19:01:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 19:01:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:01:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 179 transitions. [2024-11-08 19:01:19,910 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 179 transitions. Word has length 209 [2024-11-08 19:01:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 179 transitions. [2024-11-08 19:01:19,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:01:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 179 transitions. [2024-11-08 19:01:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:01:19,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:19,918 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:19,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:01:19,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:19,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1652981630, now seen corresponding path program 1 times [2024-11-08 19:01:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445227109] [2024-11-08 19:01:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445227109] [2024-11-08 19:01:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445227109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:20,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:20,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:01:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147054152] [2024-11-08 19:01:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:20,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:01:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:01:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:01:20,635 INFO L87 Difference]: Start difference. First operand 114 states and 179 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:20,721 INFO L93 Difference]: Finished difference Result 225 states and 355 transitions. [2024-11-08 19:01:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:01:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-08 19:01:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:20,729 INFO L225 Difference]: With dead ends: 225 [2024-11-08 19:01:20,729 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 19:01:20,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:01:20,735 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:20,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:01:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 19:01:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 19:01:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:01:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2024-11-08 19:01:20,776 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 209 [2024-11-08 19:01:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-08 19:01:20,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions. [2024-11-08 19:01:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 19:01:20,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:20,785 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:01:20,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1016191203, now seen corresponding path program 1 times [2024-11-08 19:01:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923331975] [2024-11-08 19:01:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923331975] [2024-11-08 19:01:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923331975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:21,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:01:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384532216] [2024-11-08 19:01:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:01:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:01:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:01:21,469 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:21,951 INFO L93 Difference]: Finished difference Result 337 states and 529 transitions. [2024-11-08 19:01:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:01:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-11-08 19:01:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:21,961 INFO L225 Difference]: With dead ends: 337 [2024-11-08 19:01:21,961 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 19:01:21,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:01:21,969 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 125 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:21,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 489 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:01:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 19:01:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2024-11-08 19:01:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 142 states have (on average 1.4225352112676057) internal successors, (202), 142 states have internal predecessors, (202), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 19:01:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2024-11-08 19:01:22,049 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 210 [2024-11-08 19:01:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:22,051 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2024-11-08 19:01:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2024-11-08 19:01:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:01:22,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:22,063 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:22,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:01:22,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2095234294, now seen corresponding path program 1 times [2024-11-08 19:01:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363731310] [2024-11-08 19:01:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:22,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363731310] [2024-11-08 19:01:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363731310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:01:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124105343] [2024-11-08 19:01:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:22,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:01:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:01:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:01:22,691 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:23,111 INFO L93 Difference]: Finished difference Result 526 states and 836 transitions. [2024-11-08 19:01:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:01:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-08 19:01:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:23,119 INFO L225 Difference]: With dead ends: 526 [2024-11-08 19:01:23,119 INFO L226 Difference]: Without dead ends: 381 [2024-11-08 19:01:23,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:01:23,126 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 197 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:23,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 548 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:01:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-08 19:01:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2024-11-08 19:01:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-08 19:01:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 579 transitions. [2024-11-08 19:01:23,214 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 579 transitions. Word has length 211 [2024-11-08 19:01:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:23,216 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 579 transitions. [2024-11-08 19:01:23,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 579 transitions. [2024-11-08 19:01:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:01:23,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:23,222 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:23,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:01:23,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 389922142, now seen corresponding path program 1 times [2024-11-08 19:01:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:23,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939268857] [2024-11-08 19:01:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939268857] [2024-11-08 19:01:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939268857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:24,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:24,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:01:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853386458] [2024-11-08 19:01:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:24,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:01:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:01:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:01:24,008 INFO L87 Difference]: Start difference. First operand 363 states and 579 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:24,666 INFO L93 Difference]: Finished difference Result 1014 states and 1610 transitions. [2024-11-08 19:01:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:01:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-08 19:01:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:24,673 INFO L225 Difference]: With dead ends: 1014 [2024-11-08 19:01:24,677 INFO L226 Difference]: Without dead ends: 726 [2024-11-08 19:01:24,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:01:24,680 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 443 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:24,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1296 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:01:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-08 19:01:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 660. [2024-11-08 19:01:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 494 states have (on average 1.4959514170040487) internal successors, (739), 494 states have internal predecessors, (739), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 19:01:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1059 transitions. [2024-11-08 19:01:24,765 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1059 transitions. Word has length 212 [2024-11-08 19:01:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1059 transitions. [2024-11-08 19:01:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1059 transitions. [2024-11-08 19:01:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:01:24,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:24,772 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:24,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:01:24,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1604222564, now seen corresponding path program 1 times [2024-11-08 19:01:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476453498] [2024-11-08 19:01:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476453498] [2024-11-08 19:01:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476453498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:01:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101565062] [2024-11-08 19:01:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:25,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:01:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:01:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:01:25,541 INFO L87 Difference]: Start difference. First operand 660 states and 1059 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:25,993 INFO L93 Difference]: Finished difference Result 1318 states and 2102 transitions. [2024-11-08 19:01:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:01:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-08 19:01:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:26,001 INFO L225 Difference]: With dead ends: 1318 [2024-11-08 19:01:26,001 INFO L226 Difference]: Without dead ends: 722 [2024-11-08 19:01:26,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:01:26,005 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 117 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:26,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 487 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:01:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-08 19:01:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 668. [2024-11-08 19:01:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 502 states have (on average 1.4860557768924303) internal successors, (746), 502 states have internal predecessors, (746), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 19:01:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1066 transitions. [2024-11-08 19:01:26,127 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1066 transitions. Word has length 212 [2024-11-08 19:01:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1066 transitions. [2024-11-08 19:01:26,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1066 transitions. [2024-11-08 19:01:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:01:26,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:26,134 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:01:26,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1780724955, now seen corresponding path program 1 times [2024-11-08 19:01:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114922889] [2024-11-08 19:01:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114922889] [2024-11-08 19:01:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114922889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:26,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:01:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645339918] [2024-11-08 19:01:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:26,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:01:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:01:26,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:01:26,998 INFO L87 Difference]: Start difference. First operand 668 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:27,592 INFO L93 Difference]: Finished difference Result 1711 states and 2733 transitions. [2024-11-08 19:01:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:01:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-08 19:01:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:27,602 INFO L225 Difference]: With dead ends: 1711 [2024-11-08 19:01:27,602 INFO L226 Difference]: Without dead ends: 1103 [2024-11-08 19:01:27,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:01:27,606 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 202 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:27,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 745 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:01:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-08 19:01:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 958. [2024-11-08 19:01:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 726 states have (on average 1.4917355371900827) internal successors, (1083), 726 states have internal predecessors, (1083), 224 states have call successors, (224), 7 states have call predecessors, (224), 7 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 19:01:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1531 transitions. [2024-11-08 19:01:27,755 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1531 transitions. Word has length 213 [2024-11-08 19:01:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:27,756 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1531 transitions. [2024-11-08 19:01:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1531 transitions. [2024-11-08 19:01:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:01:27,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:27,760 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:01:27,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1758092701, now seen corresponding path program 1 times [2024-11-08 19:01:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996926109] [2024-11-08 19:01:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996926109] [2024-11-08 19:01:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996926109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:01:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059821783] [2024-11-08 19:01:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:01:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:01:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:01:28,438 INFO L87 Difference]: Start difference. First operand 958 states and 1531 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:28,721 INFO L93 Difference]: Finished difference Result 1947 states and 3113 transitions. [2024-11-08 19:01:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:01:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-08 19:01:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:28,730 INFO L225 Difference]: With dead ends: 1947 [2024-11-08 19:01:28,730 INFO L226 Difference]: Without dead ends: 1220 [2024-11-08 19:01:28,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:01:28,734 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 123 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:28,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 666 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:01:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-11-08 19:01:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1150. [2024-11-08 19:01:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 918 states have (on average 1.5185185185185186) internal successors, (1394), 918 states have internal predecessors, (1394), 224 states have call successors, (224), 7 states have call predecessors, (224), 7 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 19:01:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1842 transitions. [2024-11-08 19:01:28,916 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1842 transitions. Word has length 213 [2024-11-08 19:01:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1842 transitions. [2024-11-08 19:01:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1842 transitions. [2024-11-08 19:01:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:01:28,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:28,922 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:01:28,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2120236753, now seen corresponding path program 1 times [2024-11-08 19:01:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598674869] [2024-11-08 19:01:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598674869] [2024-11-08 19:01:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598674869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:01:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751169150] [2024-11-08 19:01:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:30,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:01:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:01:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:01:30,993 INFO L87 Difference]: Start difference. First operand 1150 states and 1842 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:32,855 INFO L93 Difference]: Finished difference Result 2368 states and 3759 transitions. [2024-11-08 19:01:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:01:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-08 19:01:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:32,867 INFO L225 Difference]: With dead ends: 2368 [2024-11-08 19:01:32,868 INFO L226 Difference]: Without dead ends: 1834 [2024-11-08 19:01:32,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:01:32,873 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 661 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:32,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 603 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 19:01:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2024-11-08 19:01:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1640. [2024-11-08 19:01:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1276 states have (on average 1.493730407523511) internal successors, (1906), 1276 states have internal predecessors, (1906), 352 states have call successors, (352), 11 states have call predecessors, (352), 11 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-08 19:01:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2610 transitions. [2024-11-08 19:01:33,198 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2610 transitions. Word has length 218 [2024-11-08 19:01:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2610 transitions. [2024-11-08 19:01:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2610 transitions. [2024-11-08 19:01:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:01:33,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:33,204 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:33,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:01:33,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:33,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1357082093, now seen corresponding path program 1 times [2024-11-08 19:01:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:33,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457121880] [2024-11-08 19:01:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 19:01:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457121880] [2024-11-08 19:01:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457121880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:01:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933706064] [2024-11-08 19:01:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:01:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:33,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:01:33,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:01:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:33,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:01:34,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:01:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 951 proven. 33 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-11-08 19:01:34,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:01:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 19:01:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933706064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:01:34,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:01:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 19:01:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562074369] [2024-11-08 19:01:34,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:01:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:01:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:01:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:01:34,796 INFO L87 Difference]: Start difference. First operand 1640 states and 2610 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 19:01:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:35,426 INFO L93 Difference]: Finished difference Result 3229 states and 5092 transitions. [2024-11-08 19:01:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:01:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 218 [2024-11-08 19:01:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:35,443 INFO L225 Difference]: With dead ends: 3229 [2024-11-08 19:01:35,443 INFO L226 Difference]: Without dead ends: 1706 [2024-11-08 19:01:35,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:01:35,450 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 267 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:35,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 325 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:01:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-08 19:01:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1684. [2024-11-08 19:01:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1309 states have (on average 1.39877769289534) internal successors, (1831), 1309 states have internal predecessors, (1831), 352 states have call successors, (352), 22 states have call predecessors, (352), 22 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-08 19:01:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2535 transitions. [2024-11-08 19:01:35,820 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2535 transitions. Word has length 218 [2024-11-08 19:01:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:35,821 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2535 transitions. [2024-11-08 19:01:35,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 19:01:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2535 transitions. [2024-11-08 19:01:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:01:35,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:35,827 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:35,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:01:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 19:01:36,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -718005503, now seen corresponding path program 1 times [2024-11-08 19:01:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884817884] [2024-11-08 19:01:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884817884] [2024-11-08 19:01:36,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884817884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:36,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:36,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:01:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445825278] [2024-11-08 19:01:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:36,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:01:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:01:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:01:36,285 INFO L87 Difference]: Start difference. First operand 1684 states and 2535 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:36,623 INFO L93 Difference]: Finished difference Result 4202 states and 6302 transitions. [2024-11-08 19:01:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:01:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 221 [2024-11-08 19:01:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:36,642 INFO L225 Difference]: With dead ends: 4202 [2024-11-08 19:01:36,642 INFO L226 Difference]: Without dead ends: 2669 [2024-11-08 19:01:36,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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 19:01:36,649 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 108 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:36,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 356 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:01:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2024-11-08 19:01:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 2657. [2024-11-08 19:01:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2041 states have (on average 1.3591376776090152) internal successors, (2774), 2051 states have internal predecessors, (2774), 572 states have call successors, (572), 43 states have call predecessors, (572), 43 states have return successors, (572), 562 states have call predecessors, (572), 572 states have call successors, (572) [2024-11-08 19:01:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3918 transitions. [2024-11-08 19:01:37,144 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3918 transitions. Word has length 221 [2024-11-08 19:01:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:37,145 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 3918 transitions. [2024-11-08 19:01:37,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3918 transitions. [2024-11-08 19:01:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:01:37,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:37,150 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:01:37,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -499150785, now seen corresponding path program 1 times [2024-11-08 19:01:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947293628] [2024-11-08 19:01:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 19:01:37,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947293628] [2024-11-08 19:01:37,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947293628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:01:37,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40815180] [2024-11-08 19:01:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:37,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:01:37,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:37,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:01:37,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:01:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:37,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:01:37,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:01:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 867 proven. 27 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-11-08 19:01:38,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:01:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 19:01:38,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40815180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:01:38,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:01:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 19:01:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022688261] [2024-11-08 19:01:38,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:01:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:01:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:01:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:01:38,545 INFO L87 Difference]: Start difference. First operand 2657 states and 3918 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 19:01:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:39,158 INFO L93 Difference]: Finished difference Result 4336 states and 6320 transitions. [2024-11-08 19:01:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:01:39,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 221 [2024-11-08 19:01:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:39,173 INFO L225 Difference]: With dead ends: 4336 [2024-11-08 19:01:39,173 INFO L226 Difference]: Without dead ends: 1816 [2024-11-08 19:01:39,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:01:39,182 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 185 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:39,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 314 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:01:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-08 19:01:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1772. [2024-11-08 19:01:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1375 states have (on average 1.3207272727272727) internal successors, (1816), 1375 states have internal predecessors, (1816), 352 states have call successors, (352), 44 states have call predecessors, (352), 44 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-08 19:01:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2520 transitions. [2024-11-08 19:01:39,494 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2520 transitions. Word has length 221 [2024-11-08 19:01:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:39,495 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2520 transitions. [2024-11-08 19:01:39,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-08 19:01:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2520 transitions. [2024-11-08 19:01:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:01:39,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:39,499 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:39,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:01:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 19:01:39,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1073074748, now seen corresponding path program 1 times [2024-11-08 19:01:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804959457] [2024-11-08 19:01:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804959457] [2024-11-08 19:01:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804959457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:01:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508430713] [2024-11-08 19:01:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:01:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:01:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:01:40,071 INFO L87 Difference]: Start difference. First operand 1772 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:40,296 INFO L93 Difference]: Finished difference Result 3406 states and 4872 transitions. [2024-11-08 19:01:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:01:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 223 [2024-11-08 19:01:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:40,311 INFO L225 Difference]: With dead ends: 3406 [2024-11-08 19:01:40,311 INFO L226 Difference]: Without dead ends: 1799 [2024-11-08 19:01:40,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 19:01:40,319 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:40,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:01:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-08 19:01:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-11-08 19:01:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1402 states have (on average 1.3145506419400856) internal successors, (1843), 1402 states have internal predecessors, (1843), 352 states have call successors, (352), 44 states have call predecessors, (352), 44 states have return successors, (352), 352 states have call predecessors, (352), 352 states have call successors, (352) [2024-11-08 19:01:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2547 transitions. [2024-11-08 19:01:40,690 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2547 transitions. Word has length 223 [2024-11-08 19:01:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2547 transitions. [2024-11-08 19:01:40,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2547 transitions. [2024-11-08 19:01:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:01:40,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:40,697 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:40,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:01:40,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:40,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash -515273154, now seen corresponding path program 1 times [2024-11-08 19:01:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:40,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778876152] [2024-11-08 19:01:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:01:40,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841096266] [2024-11-08 19:01:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:40,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:01:40,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:40,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:01:40,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:01:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:41,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 19:01:41,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:01:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 373 proven. 84 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-08 19:01:42,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:01:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778876152] [2024-11-08 19:01:43,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 19:01:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841096266] [2024-11-08 19:01:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841096266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:01:43,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:01:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-08 19:01:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914425599] [2024-11-08 19:01:43,736 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 19:01:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:01:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:01:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:01:43,738 INFO L87 Difference]: Start difference. First operand 1799 states and 2547 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:01:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:45,195 INFO L93 Difference]: Finished difference Result 3418 states and 4785 transitions. [2024-11-08 19:01:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:01:45,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 223 [2024-11-08 19:01:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:45,211 INFO L225 Difference]: With dead ends: 3418 [2024-11-08 19:01:45,211 INFO L226 Difference]: Without dead ends: 2351 [2024-11-08 19:01:45,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:01:45,217 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 227 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:45,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 774 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 19:01:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-11-08 19:01:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2279. [2024-11-08 19:01:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1788 states have (on average 1.3104026845637584) internal successors, (2343), 1792 states have internal predecessors, (2343), 424 states have call successors, (424), 66 states have call predecessors, (424), 66 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2024-11-08 19:01:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3191 transitions. [2024-11-08 19:01:45,560 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3191 transitions. Word has length 223 [2024-11-08 19:01:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:45,560 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3191 transitions. [2024-11-08 19:01:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:01:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3191 transitions. [2024-11-08 19:01:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:01:45,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:45,565 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:45,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:01:45,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 19:01:45,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -78186622, now seen corresponding path program 1 times [2024-11-08 19:01:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:45,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810458839] [2024-11-08 19:01:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:01:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:01:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:01:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:01:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:01:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:01:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:01:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:01:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:01:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:01:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:01:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:01:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:01:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:01:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:01:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:01:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:01:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:01:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:01:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:01:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:01:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:01:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:01:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:01:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:01:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:01:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:01:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:01:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:01:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:01:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:01:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:01:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:01:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:01:46,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:01:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810458839] [2024-11-08 19:01:46,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810458839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:01:46,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:01:46,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:01:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135695800] [2024-11-08 19:01:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:01:46,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:01:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:01:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:01:46,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:01:46,282 INFO L87 Difference]: Start difference. First operand 2279 states and 3191 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:01:46,620 INFO L93 Difference]: Finished difference Result 3761 states and 5293 transitions. [2024-11-08 19:01:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:01:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 223 [2024-11-08 19:01:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:01:46,645 INFO L225 Difference]: With dead ends: 3761 [2024-11-08 19:01:46,645 INFO L226 Difference]: Without dead ends: 2656 [2024-11-08 19:01:46,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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 19:01:46,652 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 110 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:01:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 499 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:01:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2024-11-08 19:01:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2004. [2024-11-08 19:01:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1587 states have (on average 1.313169502205419) internal successors, (2084), 1591 states have internal predecessors, (2084), 360 states have call successors, (360), 56 states have call predecessors, (360), 56 states have return successors, (360), 356 states have call predecessors, (360), 360 states have call successors, (360) [2024-11-08 19:01:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2804 transitions. [2024-11-08 19:01:47,000 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2804 transitions. Word has length 223 [2024-11-08 19:01:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:01:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 2804 transitions. [2024-11-08 19:01:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:01:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2804 transitions. [2024-11-08 19:01:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:01:47,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:01:47,006 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:47,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:01:47,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:01:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:01:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash -587659712, now seen corresponding path program 1 times [2024-11-08 19:01:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:01:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508623206] [2024-11-08 19:01:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:01:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:01:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824242028] [2024-11-08 19:01:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:01:47,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:01:47,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:47,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:01:47,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:01:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:01:47,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:01:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:01:47,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:01:47,806 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:01:47,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:01:47,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 19:01:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 19:01:48,016 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:01:48,206 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:01:48,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:01:48 BoogieIcfgContainer [2024-11-08 19:01:48,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:01:48,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:01:48,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:01:48,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:01:48,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:01:18" (3/4) ... [2024-11-08 19:01:48,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:01:48,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:01:48,220 INFO L158 Benchmark]: Toolchain (without parser) took 31630.69ms. Allocated memory was 146.8MB in the beginning and 499.1MB in the end (delta: 352.3MB). Free memory was 109.3MB in the beginning and 302.3MB in the end (delta: -193.0MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,221 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 146.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:01:48,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.09ms. Allocated memory is still 146.8MB. Free memory was 109.3MB in the beginning and 89.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.79ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 80.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,223 INFO L158 Benchmark]: Boogie Preprocessor took 180.91ms. Allocated memory is still 146.8MB. Free memory was 80.7MB in the beginning and 68.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,223 INFO L158 Benchmark]: RCFGBuilder took 1117.99ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 68.1MB in the beginning and 129.0MB in the end (delta: -60.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,224 INFO L158 Benchmark]: TraceAbstraction took 29524.70ms. Allocated memory was 199.2MB in the beginning and 499.1MB in the end (delta: 299.9MB). Free memory was 127.9MB in the beginning and 303.3MB in the end (delta: -175.4MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-11-08 19:01:48,224 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 499.1MB. Free memory was 303.3MB in the beginning and 302.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:01:48,227 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.40ms. Allocated memory is still 146.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.09ms. Allocated memory is still 146.8MB. Free memory was 109.3MB in the beginning and 89.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.79ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 80.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 180.91ms. Allocated memory is still 146.8MB. Free memory was 80.7MB in the beginning and 68.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1117.99ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 68.1MB in the beginning and 129.0MB in the end (delta: -60.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 29524.70ms. Allocated memory was 199.2MB in the beginning and 499.1MB in the end (delta: 299.9MB). Free memory was 127.9MB in the beginning and 303.3MB in the end (delta: -175.4MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 499.1MB. Free memory was 303.3MB in the beginning and 302.3MB in the end (delta: 1.0MB). 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 187, overapproximation of bitwiseOr at line 187, overapproximation of someBinaryArithmeticDOUBLEoperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] unsigned short int var_1_26 = 26914; [L45] unsigned short int var_1_27 = 26182; [L46] unsigned char var_1_28 = 5; [L47] unsigned char var_1_29 = 50; [L48] unsigned char var_1_30 = 10; [L49] signed long int var_1_31 = -32; [L50] unsigned char var_1_32 = 0; [L51] unsigned char var_1_33 = 1; [L52] unsigned char var_1_34 = 0; [L53] signed long int var_1_35 = 1000000; [L54] signed long int var_1_36 = 64; [L55] unsigned char last_1_var_1_3 = 64; [L56] unsigned short int last_1_var_1_6 = 10; [L57] unsigned short int last_1_var_1_15 = 5; [L58] unsigned short int last_1_var_1_20 = 50; [L59] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L180] last_1_var_1_3 = var_1_3 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] var_1_5 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] var_1_9 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L135] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] var_1_10 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] var_1_11 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] var_1_14 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] var_1_26 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] var_1_27 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] var_1_29 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] var_1_30 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L174] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L174] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L177] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L177] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L195] RET updateVariables() [L196] CALL step() [L63] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L64] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L67] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L67] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L68] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L69] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L72] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L76] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L78] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L84] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L85] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L86] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L87] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L87] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L90] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L91] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=2, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L93] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L94] COND FALSE !(((((var_1_6) < (var_1_23)) ? (var_1_6) : (var_1_23))) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L97] COND TRUE var_1_27 > 0 [L98] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L100] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L101] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L105] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L106] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L106] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_21) [L109] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L112] var_1_35 = ((((var_1_26) > (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) ? (var_1_26) : (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L113] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L120] COND FALSE !(var_1_16 >= var_1_6) [L123] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L187] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L187] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L187-L188] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=9, var_1_17=0, var_1_18=-22, var_1_19=31, var_1_1=9, var_1_20=75, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=1, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2811 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2765 mSDsluCounter, 8136 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5450 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1823 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 2686 mSDtfsCounter, 1823 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2170 GetRequests, 2088 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2657occurred in iteration=11, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1366 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 4344 NumberOfCodeBlocks, 4344 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4095 ConstructedInterpolants, 0 QuantifiedInterpolants, 10839 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1508 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 37432/37696 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 19:01:48,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 ee2e1821328b1b054a61bc5eb26b8f9eaee46050974a9587636fea1af78a34a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:01:51,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:01:51,187 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:01:51,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:01:51,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:01:51,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:01:51,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:01:51,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:01:51,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:01:51,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:01:51,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:01:51,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:01:51,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:01:51,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:01:51,256 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:01:51,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:01:51,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:01:51,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:01:51,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:01:51,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:01:51,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:01:51,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:01:51,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:01:51,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:01:51,267 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:01:51,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:01:51,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:01:51,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:01:51,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:01:51,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:01:51,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:01:51,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:01:51,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:01:51,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:01:51,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:01:51,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:01:51,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:01:51,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:01:51,276 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 19:01:51,277 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:01:51,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:01:51,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:01:51,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:01:51,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:01:51,280 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 -> ee2e1821328b1b054a61bc5eb26b8f9eaee46050974a9587636fea1af78a34a8 [2024-11-08 19:01:51,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:01:51,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:01:51,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:01:51,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:01:51,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:01:51,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i Unable to find full path for "g++" [2024-11-08 19:01:54,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:01:54,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:01:54,594 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i [2024-11-08 19:01:54,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/6de025421/6251761338b64866a9ee2b9887f40859/FLAGdaa71a2f5 [2024-11-08 19:01:54,849 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/data/6de025421/6251761338b64866a9ee2b9887f40859 [2024-11-08 19:01:54,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:01:54,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:01:54,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:01:54,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:01:54,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:01:54,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:01:54" (1/1) ... [2024-11-08 19:01:54,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66073707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:54, skipping insertion in model container [2024-11-08 19:01:54,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:01:54" (1/1) ... [2024-11-08 19:01:54,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:01:55,254 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i[919,932] [2024-11-08 19:01:55,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:01:55,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:01:55,406 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_9d113df7-4db3-49d0-aa6d-7aa134b6a453/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i[919,932] [2024-11-08 19:01:55,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:01:55,526 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:01:55,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55 WrapperNode [2024-11-08 19:01:55,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:01:55,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:01:55,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:01:55,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:01:55,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,627 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-08 19:01:55,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:01:55,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:01:55,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:01:55,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:01:55,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,685 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 19:01:55,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:01:55,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:01:55,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:01:55,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:01:55,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (1/1) ... [2024-11-08 19:01:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:01:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:01:55,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:01:55,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:01:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:01:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:01:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:01:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:01:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:01:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:01:56,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:01:56,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:02:04,144 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:02:04,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:02:04,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:02:04,162 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:02:04,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:04 BoogieIcfgContainer [2024-11-08 19:02:04,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:02:04,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:02:04,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:02:04,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:02:04,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:01:54" (1/3) ... [2024-11-08 19:02:04,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abde11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:04, skipping insertion in model container [2024-11-08 19:02:04,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:01:55" (2/3) ... [2024-11-08 19:02:04,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abde11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:02:04, skipping insertion in model container [2024-11-08 19:02:04,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:02:04" (3/3) ... [2024-11-08 19:02:04,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-78.i [2024-11-08 19:02:04,196 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:02:04,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:02:04,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:02:04,307 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;@1f9ad413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:02:04,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:02:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:02:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 19:02:04,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:04,342 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:04,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1476834258, now seen corresponding path program 1 times [2024-11-08 19:02:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671487913] [2024-11-08 19:02:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:04,368 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 19:02:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:04,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:04,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:05,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:02:05,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:02:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-08 19:02:05,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:02:05,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:02:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671487913] [2024-11-08 19:02:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671487913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:02:05,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:02:05,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:02:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608474415] [2024-11-08 19:02:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:02:05,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:02:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:02:05,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:02:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:02:05,229 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:02:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:02:05,274 INFO L93 Difference]: Finished difference Result 173 states and 306 transitions. [2024-11-08 19:02:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:02:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-08 19:02:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:02:05,292 INFO L225 Difference]: With dead ends: 173 [2024-11-08 19:02:05,293 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 19:02:05,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 19:02:05,305 INFO L432 NwaCegarLoop]: 133 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, 133 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 19:02:05,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:02:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 19:02:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 19:02:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:02:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-08 19:02:05,420 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 203 [2024-11-08 19:02:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:02:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-08 19:02:05,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 19:02:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-08 19:02:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 19:02:05,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:05,432 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:05,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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)] Ended with exit code 0 [2024-11-08 19:02:05,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:05,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1400296290, now seen corresponding path program 1 times [2024-11-08 19:02:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701767838] [2024-11-08 19:02:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:05,637 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 19:02:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:05,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:05,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:02:06,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:02:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:02:09,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:02:09,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:02:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701767838] [2024-11-08 19:02:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701767838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:02:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:02:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:02:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343948613] [2024-11-08 19:02:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:02:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:02:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:02:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:02:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:02:09,838 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:15,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:16,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:20,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:26,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:02:26,004 INFO L93 Difference]: Finished difference Result 276 states and 430 transitions. [2024-11-08 19:02:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:02:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-08 19:02:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:02:26,035 INFO L225 Difference]: With dead ends: 276 [2024-11-08 19:02:26,036 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 19:02:26,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:02:26,046 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 107 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:02:26,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 482 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time] [2024-11-08 19:02:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 19:02:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 167. [2024-11-08 19:02:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 19:02:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 261 transitions. [2024-11-08 19:02:26,093 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 261 transitions. Word has length 203 [2024-11-08 19:02:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:02:26,095 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 261 transitions. [2024-11-08 19:02:26,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 261 transitions. [2024-11-08 19:02:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 19:02:26,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:26,104 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:26,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:26,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 582647840, now seen corresponding path program 1 times [2024-11-08 19:02:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889007128] [2024-11-08 19:02:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:26,313 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 19:02:26,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:26,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:26,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:26,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:02:26,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:02:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:02:26,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:02:26,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:02:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889007128] [2024-11-08 19:02:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889007128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:02:26,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:02:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:02:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870740919] [2024-11-08 19:02:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:02:26,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:02:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:02:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:02:26,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:02:26,998 INFO L87 Difference]: Start difference. First operand 167 states and 261 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:31,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:02:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:02:31,138 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2024-11-08 19:02:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:02:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-11-08 19:02:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:02:31,172 INFO L225 Difference]: With dead ends: 250 [2024-11-08 19:02:31,172 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 19:02:31,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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 19:02:31,175 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:02:31,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 19:02:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 19:02:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-08 19:02:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 19:02:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 259 transitions. [2024-11-08 19:02:31,232 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 259 transitions. Word has length 203 [2024-11-08 19:02:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:02:31,233 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 259 transitions. [2024-11-08 19:02:31,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 259 transitions. [2024-11-08 19:02:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 19:02:31,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:31,239 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:31,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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)] Ended with exit code 0 [2024-11-08 19:02:31,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:31,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1925914156, now seen corresponding path program 1 times [2024-11-08 19:02:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496191375] [2024-11-08 19:02:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:31,443 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 19:02:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:31,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:31,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (5)] Waiting until timeout for monitored process [2024-11-08 19:02:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:32,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:02:32,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:02:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:02:35,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:02:35,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:02:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496191375] [2024-11-08 19:02:35,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496191375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:02:35,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:02:35,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:02:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285259748] [2024-11-08 19:02:35,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:02:35,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:02:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:02:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:02:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:02:35,762 INFO L87 Difference]: Start difference. First operand 167 states and 259 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:39,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:41,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:45,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:48,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:51,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:55,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:57,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:02:57,592 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2024-11-08 19:02:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:02:57,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-11-08 19:02:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:02:57,640 INFO L225 Difference]: With dead ends: 458 [2024-11-08 19:02:57,641 INFO L226 Difference]: Without dead ends: 375 [2024-11-08 19:02:57,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:02:57,645 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 261 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:02:57,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 463 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 418 Invalid, 1 Unknown, 0 Unchecked, 21.5s Time] [2024-11-08 19:02:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-08 19:02:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 308. [2024-11-08 19:02:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 175 states have internal predecessors, (222), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-08 19:02:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 478 transitions. [2024-11-08 19:02:57,796 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 478 transitions. Word has length 204 [2024-11-08 19:02:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:02:57,801 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 478 transitions. [2024-11-08 19:02:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:02:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 478 transitions. [2024-11-08 19:02:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 19:02:57,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:57,810 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:02:57,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (5)] Forceful destruction successful, exit code 0 [2024-11-08 19:02:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:58,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 914796906, now seen corresponding path program 1 times [2024-11-08 19:02:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547109887] [2024-11-08 19:02:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:58,012 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 19:02:58,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:58,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:02:58,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (6)] Waiting until timeout for monitored process [2024-11-08 19:02:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:58,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 19:02:58,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:03:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 964 proven. 60 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-08 19:03:00,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:03:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-08 19:03:01,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:03:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547109887] [2024-11-08 19:03:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547109887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:03:01,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:03:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-08 19:03:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119565849] [2024-11-08 19:03:01,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:03:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:03:01,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:03:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:03:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:03:01,378 INFO L87 Difference]: Start difference. First operand 308 states and 478 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-08 19:03:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:03:03,257 INFO L93 Difference]: Finished difference Result 593 states and 893 transitions. [2024-11-08 19:03:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:03:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 204 [2024-11-08 19:03:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:03:03,266 INFO L225 Difference]: With dead ends: 593 [2024-11-08 19:03:03,266 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 19:03:03,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:03:03,271 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:03:03,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 256 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 19:03:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 19:03:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2024-11-08 19:03:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 199 states have internal predecessors, (237), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-08 19:03:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 493 transitions. [2024-11-08 19:03:03,353 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 493 transitions. Word has length 204 [2024-11-08 19:03:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:03:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 493 transitions. [2024-11-08 19:03:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-08 19:03:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 493 transitions. [2024-11-08 19:03:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:03:03,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:03:03,361 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:03,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (6)] Ended with exit code 0 [2024-11-08 19:03:03,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:03:03,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:03:03,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:03:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2031153170, now seen corresponding path program 1 times [2024-11-08 19:03:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:03:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779490832] [2024-11-08 19:03:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:03,565 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 19:03:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:03:03,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:03:03,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (7)] Waiting until timeout for monitored process [2024-11-08 19:03:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:05,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 19:03:05,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:03:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 643 proven. 75 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2024-11-08 19:03:08,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:03:11,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:03:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779490832] [2024-11-08 19:03:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779490832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:03:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86792255] [2024-11-08 19:03:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:11,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:03:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:03:11,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:03:11,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 19:03:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:13,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:03:13,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:03:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:03:15,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:03:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86792255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:03:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:03:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-08 19:03:15,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897082220] [2024-11-08 19:03:15,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:03:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:03:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:03:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:03:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:03:15,067 INFO L87 Difference]: Start difference. First operand 340 states and 493 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:03:19,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:24,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:27,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:32,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:03:32,223 INFO L93 Difference]: Finished difference Result 677 states and 974 transitions. [2024-11-08 19:03:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:03:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-08 19:03:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:03:32,230 INFO L225 Difference]: With dead ends: 677 [2024-11-08 19:03:32,230 INFO L226 Difference]: Without dead ends: 497 [2024-11-08 19:03:32,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:03:32,232 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 76 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:03:32,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 379 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 17.1s Time] [2024-11-08 19:03:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-08 19:03:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2024-11-08 19:03:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 310 states have internal predecessors, (378), 164 states have call successors, (164), 18 states have call predecessors, (164), 18 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-08 19:03:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 706 transitions. [2024-11-08 19:03:32,328 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 706 transitions. Word has length 206 [2024-11-08 19:03:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:03:32,329 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 706 transitions. [2024-11-08 19:03:32,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:03:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 706 transitions. [2024-11-08 19:03:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:03:32,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:03:32,334 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:32,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (7)] Ended with exit code 0 [2024-11-08 19:03:32,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 19:03:32,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:03:32,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:03:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:03:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1827733266, now seen corresponding path program 1 times [2024-11-08 19:03:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:03:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114869127] [2024-11-08 19:03:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:32,739 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 19:03:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:03:32,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:03:32,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (9)] Waiting until timeout for monitored process [2024-11-08 19:03:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:33,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:03:33,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:03:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 19:03:36,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:03:36,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:03:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114869127] [2024-11-08 19:03:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114869127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:03:36,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:03:36,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:03:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987719250] [2024-11-08 19:03:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:03:36,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:03:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:03:36,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:03:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:03:36,256 INFO L87 Difference]: Start difference. First operand 491 states and 706 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:03:40,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:44,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:46,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:03:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:03:46,602 INFO L93 Difference]: Finished difference Result 702 states and 1010 transitions. [2024-11-08 19:03:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:03:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-11-08 19:03:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:03:46,612 INFO L225 Difference]: With dead ends: 702 [2024-11-08 19:03:46,612 INFO L226 Difference]: Without dead ends: 493 [2024-11-08 19:03:46,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:03:46,615 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 30 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:03:46,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 281 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-08 19:03:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-08 19:03:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2024-11-08 19:03:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 308 states have (on average 1.224025974025974) internal successors, (377), 310 states have internal predecessors, (377), 164 states have call successors, (164), 18 states have call predecessors, (164), 18 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-08 19:03:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 705 transitions. [2024-11-08 19:03:46,708 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 705 transitions. Word has length 206 [2024-11-08 19:03:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:03:46,709 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 705 transitions. [2024-11-08 19:03:46,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 19:03:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 705 transitions. [2024-11-08 19:03:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:03:46,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:03:46,712 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:03:46,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (9)] Forceful destruction successful, exit code 0 [2024-11-08 19:03:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:03:46,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:03:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:03:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1446165676, now seen corresponding path program 1 times [2024-11-08 19:03:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:03:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234387748] [2024-11-08 19:03:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:46,920 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 19:03:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:03:46,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 19:03:46,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d113df7-4db3-49d0-aa6d-7aa134b6a453/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 (10)] Waiting until timeout for monitored process [2024-11-08 19:03:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:48,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 19:03:48,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:34,564 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:40,869 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:47,470 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:54,524 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:02,652 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:10,730 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:18,808 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:26,927 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:33,987 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:41,902 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:49,966 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:58,049 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:05,374 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:13,451 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:19,781 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:27,013 WARN L286 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:35,004 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:43,247 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:51,335 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:59,179 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:05,981 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:14,107 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:22,251 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:27,496 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:35,593 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:43,680 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:51,758 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:59,884 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:07,981 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:16,085 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:32,596 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:36,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse6 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse2 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (fp.geq c_~var_1_10~0 .cse1) (bvsle .cse2 (_ bv32 32)) (let ((.cse4 (bvadd (_ bv10 32) .cse6)) (.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse3 (bvsgt .cse4 .cse5))) (or (and .cse3 (= ((_ extract 15 0) .cse4) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse5) c_~var_1_20~0) (not .cse3))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse7) (fp.geq c_~var_1_14~0 .cse1) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse7) (fp.geq c_~var_1_13~0 .cse1) (fp.geq c_~var_1_12~0 .cse1) (fp.leq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_10~0 .cse7) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse10 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse9 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse10))) (and (not .cse9) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse10))))) (fp.leq c_~var_1_11~0 .cse7) (fp.geq c_~var_1_11~0 .cse1) (bvslt (_ bv64 32) (bvsrem .cse6 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse2 (_ bv4294967265 32)))) is different from false [2024-11-08 19:09:44,906 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:50,995 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:09:59,088 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:07,189 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:14,432 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:21,636 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:29,730 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:37,886 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:46,049 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:10:54,142 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:01,725 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:09,859 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:17,969 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:26,078 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:34,209 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:42,349 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:49,284 WARN L286 SmtUtils]: Spent 6.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:11:57,395 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:05,506 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:13,243 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:21,337 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:29,445 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:36,590 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:44,685 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:12:52,771 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:00,896 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:13,052 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:21,197 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:29,353 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:35,371 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:43,474 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:51,584 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:13:59,722 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:07,463 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:14,239 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:22,336 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:30,473 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:36,858 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:40,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse6 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse2 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (fp.geq c_~var_1_10~0 .cse1) (bvsle .cse2 (_ bv32 32)) (let ((.cse4 (bvadd (_ bv10 32) .cse6)) (.cse5 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse3 (bvsgt .cse4 .cse5))) (or (and .cse3 (= ((_ extract 15 0) .cse4) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse5) c_~var_1_20~0) (not .cse3))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse7) (fp.geq c_~var_1_14~0 .cse1) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse7) (fp.geq c_~var_1_13~0 .cse1) (fp.geq c_~var_1_12~0 .cse1) (fp.leq c_~var_1_13~0 .cse7) (fp.leq c_~var_1_10~0 .cse7) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (bvslt .cse0 (_ bv0 32)))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) (bvadd .cse0 .cse8 .cse2))) (not .cse9)) (and (= ((_ extract 7 0) (bvadd .cse8 .cse2 (bvneg .cse0))) c_~var_1_16~0) .cse9))) (let ((.cse10 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse11 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse10 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse11))) (and (not .cse10) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse11))))) (fp.leq c_~var_1_11~0 .cse7) (fp.geq c_~var_1_11~0 .cse1) (let ((.cse12 ((_ sign_extend 24) c_~var_1_16~0))) (let ((.cse13 (bvslt .cse12 (_ bv0 32)))) (or (and (= c_~var_1_1~0 (bvneg .cse12)) .cse13) (and (not .cse13) (= .cse12 c_~var_1_1~0))))) (bvslt (_ bv64 32) (bvsrem .cse6 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse2 (_ bv4294967265 32)))) is different from false [2024-11-08 19:14:48,557 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:14:56,649 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:04,781 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:12,922 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:21,019 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:27,921 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:36,021 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:44,182 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:15:52,346 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)