./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:21:00,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:21:00,116 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:21:00,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:21:00,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:21:00,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:21:00,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:21:00,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:21:00,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:21:00,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:21:00,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:21:00,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:21:00,155 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:21:00,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:21:00,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:21:00,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:21:00,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:21:00,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:21:00,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:21:00,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:21:00,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:21:00,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:21:00,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:21:00,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:21:00,162 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:21:00,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:21:00,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:21:00,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:21:00,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:00,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:21:00,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:21:00,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:21:00,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:21:00,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:21:00,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:21:00,169 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:21:00,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:21:00,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:21:00,170 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:21:00,170 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_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2023-11-06 22:21:00,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:21:00,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:21:00,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:21:00,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:21:00,528 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:21:00,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:21:03,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:21:04,095 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:21:04,096 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:21:04,107 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/d6edea35b/13f8c0b34db64041bd6f3e7ef7221503/FLAG351b5f91f [2023-11-06 22:21:04,123 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/d6edea35b/13f8c0b34db64041bd6f3e7ef7221503 [2023-11-06 22:21:04,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:21:04,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:21:04,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:04,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:21:04,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:21:04,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b994bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04, skipping insertion in model container [2023-11-06 22:21:04,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:21:04,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-06 22:21:04,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:04,429 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:21:04,442 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-06 22:21:04,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:04,505 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:21:04,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04 WrapperNode [2023-11-06 22:21:04,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:04,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:04,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:21:04,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:21:04,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,595 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2023-11-06 22:21:04,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:04,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:21:04,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:21:04,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:21:04,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:21:04,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:21:04,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:21:04,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:21:04,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (1/1) ... [2023-11-06 22:21:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:04,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:21:04,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:21:04,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:21:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:21:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:21:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:21:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:21:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:21:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:21:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:21:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:21:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:21:04,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:21:04,917 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:21:04,919 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:21:05,567 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:21:05,583 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:21:05,586 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:21:05,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05 BoogieIcfgContainer [2023-11-06 22:21:05,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:21:05,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:21:05,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:21:05,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:21:05,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:21:04" (1/3) ... [2023-11-06 22:21:05,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469ef6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:05, skipping insertion in model container [2023-11-06 22:21:05,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:04" (2/3) ... [2023-11-06 22:21:05,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469ef6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:05, skipping insertion in model container [2023-11-06 22:21:05,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05" (3/3) ... [2023-11-06 22:21:05,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:21:05,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:21:05,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:21:05,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:21:05,690 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@51990093, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:21:05,690 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:21:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:05,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:05,723 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:05,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:05,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1710126378, now seen corresponding path program 1 times [2023-11-06 22:21:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337367888] [2023-11-06 22:21:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:06,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:06,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337367888] [2023-11-06 22:21:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337367888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:06,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:06,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:21:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180473270] [2023-11-06 22:21:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:06,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:21:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:21:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:21:06,499 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:06,570 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2023-11-06 22:21:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:21:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 22:21:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:06,586 INFO L225 Difference]: With dead ends: 233 [2023-11-06 22:21:06,586 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:21:06,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:21:06,603 INFO L413 NwaCegarLoop]: 168 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, 168 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 [2023-11-06 22:21:06,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:21:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-06 22:21:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-11-06 22:21:06,674 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2023-11-06 22:21:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:06,675 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-11-06 22:21:06,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-11-06 22:21:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:06,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:06,683 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:21:06,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:06,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 455950076, now seen corresponding path program 1 times [2023-11-06 22:21:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559639284] [2023-11-06 22:21:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559639284] [2023-11-06 22:21:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559639284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057272282] [2023-11-06 22:21:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:07,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:07,185 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:07,249 INFO L93 Difference]: Finished difference Result 235 states and 342 transitions. [2023-11-06 22:21:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 22:21:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:07,253 INFO L225 Difference]: With dead ends: 235 [2023-11-06 22:21:07,253 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:21:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:21:07,256 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 10 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:07,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 492 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:21:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2023-11-06 22:21:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2023-11-06 22:21:07,277 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2023-11-06 22:21:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:07,278 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2023-11-06 22:21:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2023-11-06 22:21:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:07,283 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:21:07,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:07,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 70087674, now seen corresponding path program 1 times [2023-11-06 22:21:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:07,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139985090] [2023-11-06 22:21:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139985090] [2023-11-06 22:21:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139985090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:07,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836122869] [2023-11-06 22:21:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:07,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:07,730 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:07,809 INFO L93 Difference]: Finished difference Result 241 states and 348 transitions. [2023-11-06 22:21:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:21:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:07,815 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:21:07,818 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:21:07,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:21:07,822 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:07,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:21:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2023-11-06 22:21:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-11-06 22:21:07,849 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2023-11-06 22:21:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:07,851 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-11-06 22:21:07,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-11-06 22:21:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:07,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:07,861 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:21:07,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:07,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1845095036, now seen corresponding path program 1 times [2023-11-06 22:21:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545010959] [2023-11-06 22:21:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:08,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545010959] [2023-11-06 22:21:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545010959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:08,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183376430] [2023-11-06 22:21:08,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:08,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:08,240 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:08,287 INFO L93 Difference]: Finished difference Result 241 states and 346 transitions. [2023-11-06 22:21:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:21:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:08,291 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:21:08,292 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:21:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:21:08,296 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:08,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 488 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:21:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-11-06 22:21:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2023-11-06 22:21:08,321 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2023-11-06 22:21:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:08,322 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2023-11-06 22:21:08,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2023-11-06 22:21:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:08,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:08,325 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:21:08,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:08,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1846942078, now seen corresponding path program 1 times [2023-11-06 22:21:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407983960] [2023-11-06 22:21:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:08,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407983960] [2023-11-06 22:21:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407983960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:08,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:08,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294619367] [2023-11-06 22:21:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:08,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:08,766 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:08,798 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2023-11-06 22:21:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:21:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:21:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:08,801 INFO L225 Difference]: With dead ends: 252 [2023-11-06 22:21:08,801 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 22:21:08,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:08,803 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 14 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:08,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 22:21:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2023-11-06 22:21:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2023-11-06 22:21:08,817 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 190 [2023-11-06 22:21:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2023-11-06 22:21:08,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2023-11-06 22:21:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:08,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:08,822 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:08,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:21:08,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:08,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -76285956, now seen corresponding path program 1 times [2023-11-06 22:21:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:08,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244052751] [2023-11-06 22:21:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244052751] [2023-11-06 22:21:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244052751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:09,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:09,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585739140] [2023-11-06 22:21:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:09,756 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:10,265 INFO L93 Difference]: Finished difference Result 252 states and 358 transitions. [2023-11-06 22:21:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:21:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:21:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:10,273 INFO L225 Difference]: With dead ends: 252 [2023-11-06 22:21:10,273 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:21:10,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:21:10,276 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 122 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:10,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 339 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:21:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:21:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2023-11-06 22:21:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:21:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2023-11-06 22:21:10,313 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 190 [2023-11-06 22:21:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:10,314 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2023-11-06 22:21:10,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2023-11-06 22:21:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:10,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:10,317 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:10,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:21:10,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:10,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1061821824, now seen corresponding path program 1 times [2023-11-06 22:21:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:10,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023982286] [2023-11-06 22:21:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023982286] [2023-11-06 22:21:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023982286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:21:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886723568] [2023-11-06 22:21:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:13,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:21:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:21:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:13,514 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:14,427 INFO L93 Difference]: Finished difference Result 311 states and 439 transitions. [2023-11-06 22:21:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:21:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 22:21:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:14,430 INFO L225 Difference]: With dead ends: 311 [2023-11-06 22:21:14,431 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 22:21:14,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:21:14,432 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:14,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 359 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:21:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 22:21:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2023-11-06 22:21:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.326797385620915) internal successors, (203), 154 states have internal predecessors, (203), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-06 22:21:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2023-11-06 22:21:14,457 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 190 [2023-11-06 22:21:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:14,458 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2023-11-06 22:21:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2023-11-06 22:21:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:14,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:14,461 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:14,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:21:14,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:14,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1239000766, now seen corresponding path program 1 times [2023-11-06 22:21:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595730231] [2023-11-06 22:21:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:17,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595730231] [2023-11-06 22:21:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595730231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:21:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264868112] [2023-11-06 22:21:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:17,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:21:17,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:21:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:21:17,668 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:19,086 INFO L93 Difference]: Finished difference Result 455 states and 636 transitions. [2023-11-06 22:21:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:21:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 22:21:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:19,091 INFO L225 Difference]: With dead ends: 455 [2023-11-06 22:21:19,091 INFO L226 Difference]: Without dead ends: 273 [2023-11-06 22:21:19,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:21:19,093 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 632 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:19,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 630 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:21:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-06 22:21:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2023-11-06 22:21:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 166 states have internal predecessors, (218), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-06 22:21:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2023-11-06 22:21:19,120 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 190 [2023-11-06 22:21:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:19,121 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2023-11-06 22:21:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:21:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2023-11-06 22:21:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:19,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:19,124 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:21:19,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:19,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1160965271, now seen corresponding path program 1 times [2023-11-06 22:21:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601259428] [2023-11-06 22:21:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:19,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:19,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601259428] [2023-11-06 22:21:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601259428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:19,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738070494] [2023-11-06 22:21:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:19,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:19,923 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:20,220 INFO L93 Difference]: Finished difference Result 556 states and 774 transitions. [2023-11-06 22:21:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:21:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:21:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:20,226 INFO L225 Difference]: With dead ends: 556 [2023-11-06 22:21:20,226 INFO L226 Difference]: Without dead ends: 361 [2023-11-06 22:21:20,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:20,230 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 144 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:20,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 723 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:21:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-06 22:21:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 255. [2023-11-06 22:21:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 219 states have (on average 1.3378995433789955) internal successors, (293), 221 states have internal predecessors, (293), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:21:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 355 transitions. [2023-11-06 22:21:20,276 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 355 transitions. Word has length 190 [2023-11-06 22:21:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:20,281 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 355 transitions. [2023-11-06 22:21:20,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:21:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2023-11-06 22:21:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:20,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:20,286 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:20,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:21:20,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:20,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1139857319, now seen corresponding path program 1 times [2023-11-06 22:21:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393117592] [2023-11-06 22:21:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:24,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:24,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393117592] [2023-11-06 22:21:24,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393117592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:24,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-06 22:21:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864081263] [2023-11-06 22:21:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:24,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:21:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:21:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:21:24,137 INFO L87 Difference]: Start difference. First operand 255 states and 355 transitions. Second operand has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 22:21:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:27,164 INFO L93 Difference]: Finished difference Result 796 states and 1114 transitions. [2023-11-06 22:21:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:21:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 22:21:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:27,169 INFO L225 Difference]: With dead ends: 796 [2023-11-06 22:21:27,170 INFO L226 Difference]: Without dead ends: 544 [2023-11-06 22:21:27,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:21:27,172 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 716 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:27,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1082 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-06 22:21:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-11-06 22:21:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 286. [2023-11-06 22:21:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 250 states have (on average 1.368) internal successors, (342), 252 states have internal predecessors, (342), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:21:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 404 transitions. [2023-11-06 22:21:27,237 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 404 transitions. Word has length 190 [2023-11-06 22:21:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:27,238 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 404 transitions. [2023-11-06 22:21:27,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 22:21:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 404 transitions. [2023-11-06 22:21:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:27,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:27,243 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:27,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:21:27,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:27,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1104987260, now seen corresponding path program 1 times [2023-11-06 22:21:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703281091] [2023-11-06 22:21:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:21:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703281091] [2023-11-06 22:21:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703281091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 22:21:30,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129445646] [2023-11-06 22:21:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:30,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:21:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:21:30,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:21:30,462 INFO L87 Difference]: Start difference. First operand 286 states and 404 transitions. Second operand has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 22:21:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:32,717 INFO L93 Difference]: Finished difference Result 696 states and 976 transitions. [2023-11-06 22:21:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:21:32,718 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2023-11-06 22:21:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:32,722 INFO L225 Difference]: With dead ends: 696 [2023-11-06 22:21:32,723 INFO L226 Difference]: Without dead ends: 413 [2023-11-06 22:21:32,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:21:32,725 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 507 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:32,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1075 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:21:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-11-06 22:21:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 281. [2023-11-06 22:21:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.363265306122449) internal successors, (334), 247 states have internal predecessors, (334), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:21:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 396 transitions. [2023-11-06 22:21:32,761 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 396 transitions. Word has length 190 [2023-11-06 22:21:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:32,762 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 396 transitions. [2023-11-06 22:21:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 22:21:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 396 transitions. [2023-11-06 22:21:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:21:32,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:32,766 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:32,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:21:32,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:32,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1309917438, now seen corresponding path program 1 times [2023-11-06 22:21:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146570140] [2023-11-06 22:21:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 22:21:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146570140] [2023-11-06 22:21:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146570140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683901385] [2023-11-06 22:21:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:34,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:34,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:34,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:21:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:34,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:21:34,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:35,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:21:35,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:21:35,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:35,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:35,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:36,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:36,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:36,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:36,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:36,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:36,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 5 proven. 471 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2023-11-06 22:21:36,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:21:36,481 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_962) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (< .cse0 (+ 256 (* 256 (div (+ (- 1) .cse0) 256)))))) is different from false [2023-11-06 22:21:36,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683901385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:36,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:21:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-11-06 22:21:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707840581] [2023-11-06 22:21:36,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:21:36,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:21:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:21:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2023-11-06 22:21:36,528 INFO L87 Difference]: Start difference. First operand 281 states and 396 transitions. Second operand has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:21:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:37,560 INFO L93 Difference]: Finished difference Result 495 states and 684 transitions. [2023-11-06 22:21:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:21:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) Word has length 190 [2023-11-06 22:21:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:37,564 INFO L225 Difference]: With dead ends: 495 [2023-11-06 22:21:37,565 INFO L226 Difference]: Without dead ends: 217 [2023-11-06 22:21:37,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=424, Unknown=1, NotChecked=44, Total=600 [2023-11-06 22:21:37,567 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 117 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:37,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 508 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:21:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-06 22:21:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2023-11-06 22:21:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.2816091954022988) internal successors, (223), 176 states have internal predecessors, (223), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:21:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2023-11-06 22:21:37,598 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 190 [2023-11-06 22:21:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:37,599 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2023-11-06 22:21:37,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 6 states have call successors, (50), 4 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:21:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2023-11-06 22:21:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:21:37,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:37,602 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:37,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:21:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:21:37,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:37,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1181030633, now seen corresponding path program 1 times [2023-11-06 22:21:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355311854] [2023-11-06 22:21:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 22:21:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355311854] [2023-11-06 22:21:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355311854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414460676] [2023-11-06 22:21:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:39,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:39,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:21:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:40,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 22:21:40,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:40,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:21:41,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:41,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:41,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:41,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:41,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:41,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:42,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:42,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:42,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:42,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:42,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:43,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:43,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:43,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:43,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:43,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:43,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:43,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:43,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:44,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:44,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:44,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2023-11-06 22:21:44,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:44,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:44,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:44,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:44,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-11-06 22:21:44,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-11-06 22:21:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2023-11-06 22:21:44,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:21:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414460676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:48,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:21:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 22:21:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333156262] [2023-11-06 22:21:48,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:21:48,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:21:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:21:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=399, Unknown=17, NotChecked=0, Total=506 [2023-11-06 22:21:48,427 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand has 20 states, 18 states have (on average 7.277777777777778) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:21:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:50,373 INFO L93 Difference]: Finished difference Result 466 states and 624 transitions. [2023-11-06 22:21:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:21:50,375 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.277777777777778) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) Word has length 192 [2023-11-06 22:21:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:50,377 INFO L225 Difference]: With dead ends: 466 [2023-11-06 22:21:50,378 INFO L226 Difference]: Without dead ends: 277 [2023-11-06 22:21:50,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=268, Invalid=771, Unknown=17, NotChecked=0, Total=1056 [2023-11-06 22:21:50,380 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 202 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:50,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 433 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:21:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-06 22:21:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 220. [2023-11-06 22:21:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 180 states have (on average 1.2722222222222221) internal successors, (229), 182 states have internal predecessors, (229), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:21:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 291 transitions. [2023-11-06 22:21:50,412 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 291 transitions. Word has length 192 [2023-11-06 22:21:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:50,413 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 291 transitions. [2023-11-06 22:21:50,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.277777777777778) internal successors, (131), 20 states have internal predecessors, (131), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:21:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 291 transitions. [2023-11-06 22:21:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:21:50,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:50,416 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:50,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:21:50,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:50,623 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:50,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1119791957, now seen corresponding path program 1 times [2023-11-06 22:21:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124014019] [2023-11-06 22:21:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:21:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:21:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:21:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:21:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:21:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:21:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:21:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:21:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:21:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:21:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:21:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:21:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:21:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:21:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:21:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:21:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:21:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:21:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:21:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:21:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:21:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-06 22:21:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:21:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:21:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 22:21:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124014019] [2023-11-06 22:21:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124014019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:21:53,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290285016] [2023-11-06 22:21:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:53,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:53,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:53,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:53,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:21:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:53,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:21:53,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:54,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:21:55,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:55,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:55,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:55,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:55,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:55,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:56,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:56,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:56,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:56,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:57,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:57,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:57,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:57,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:58,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:58,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:58,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:59,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:59,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:59,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:59,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:59,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:21:59,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:21:59,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:21:59,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2023-11-06 22:21:59,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-06 22:21:59,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2023-11-06 22:21:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 222 proven. 126 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2023-11-06 22:21:59,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:22:00,707 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_ArrVal_1297 (Array Int Int))) (let ((.cse0 (mod (select (select (store (store (store (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1297) |c_~#signed_char_Array_0~0.base| v_ArrVal_1298) |c_~#float_Array_0~0.base| v_ArrVal_1301) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1300) |c_~#double_Array_0~0.base| v_ArrVal_1299) |c_~#BOOL_unsigned_char_Array_0~0.base|) (+ 2 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) 256))) (or (= .cse0 0) (= .cse0 1)))) is different from false [2023-11-06 22:22:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290285016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:22:00,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:22:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2023-11-06 22:22:00,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888501135] [2023-11-06 22:22:00,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:22:00,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 22:22:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 22:22:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=968, Unknown=11, NotChecked=64, Total=1190 [2023-11-06 22:22:00,792 INFO L87 Difference]: Start difference. First operand 220 states and 291 transitions. Second operand has 28 states, 26 states have (on average 5.153846153846154) internal successors, (134), 28 states have internal predecessors, (134), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:22:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:22:03,944 INFO L93 Difference]: Finished difference Result 460 states and 612 transitions. [2023-11-06 22:22:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:22:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 5.153846153846154) internal successors, (134), 28 states have internal predecessors, (134), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) Word has length 192 [2023-11-06 22:22:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:22:03,948 INFO L225 Difference]: With dead ends: 460 [2023-11-06 22:22:03,948 INFO L226 Difference]: Without dead ends: 264 [2023-11-06 22:22:03,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=464, Invalid=1881, Unknown=11, NotChecked=94, Total=2450 [2023-11-06 22:22:03,951 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 889 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:22:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 846 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-06 22:22:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-06 22:22:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 203. [2023-11-06 22:22:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 170 states have internal predecessors, (218), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:22:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 272 transitions. [2023-11-06 22:22:03,985 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 272 transitions. Word has length 192 [2023-11-06 22:22:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:22:03,986 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 272 transitions. [2023-11-06 22:22:03,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 5.153846153846154) internal successors, (134), 28 states have internal predecessors, (134), 6 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (50), 4 states have call predecessors, (50), 6 states have call successors, (50) [2023-11-06 22:22:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 272 transitions. [2023-11-06 22:22:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:22:03,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:03,989 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:04,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:22:04,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:22:04,197 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:22:04,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1020648510, now seen corresponding path program 1 times [2023-11-06 22:22:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:22:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405540303] [2023-11-06 22:22:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:22:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:22:04,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:22:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:22:04,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:22:04,756 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:22:04,758 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:22:04,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:22:04,764 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:04,769 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:22:04,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:04 BoogieIcfgContainer [2023-11-06 22:22:04,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:22:04,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:22:04,927 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:22:04,928 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:22:04,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05" (3/4) ... [2023-11-06 22:22:04,931 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:22:04,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:22:04,933 INFO L158 Benchmark]: Toolchain (without parser) took 60804.80ms. Allocated memory was 188.7MB in the beginning and 616.6MB in the end (delta: 427.8MB). Free memory was 151.6MB in the beginning and 262.9MB in the end (delta: -111.3MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,933 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 151.9MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:04,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.78ms. Allocated memory is still 188.7MB. Free memory was 150.8MB in the beginning and 135.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.23ms. Allocated memory is still 188.7MB. Free memory was 135.6MB in the beginning and 130.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,935 INFO L158 Benchmark]: Boogie Preprocessor took 67.88ms. Allocated memory is still 188.7MB. Free memory was 130.6MB in the beginning and 127.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,936 INFO L158 Benchmark]: RCFGBuilder took 925.11ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 95.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,936 INFO L158 Benchmark]: TraceAbstraction took 59331.46ms. Allocated memory was 188.7MB in the beginning and 616.6MB in the end (delta: 427.8MB). Free memory was 94.2MB in the beginning and 262.9MB in the end (delta: -168.7MB). Peak memory consumption was 261.7MB. Max. memory is 16.1GB. [2023-11-06 22:22:04,937 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 616.6MB. Free memory is still 262.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:04,945 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.26ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 151.9MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.78ms. Allocated memory is still 188.7MB. Free memory was 150.8MB in the beginning and 135.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.23ms. Allocated memory is still 188.7MB. Free memory was 135.6MB in the beginning and 130.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.88ms. Allocated memory is still 188.7MB. Free memory was 130.6MB in the beginning and 127.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 925.11ms. Allocated memory is still 188.7MB. Free memory was 127.2MB in the beginning and 95.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59331.46ms. Allocated memory was 188.7MB in the beginning and 616.6MB in the end (delta: 427.8MB). Free memory was 94.2MB in the beginning and 262.9MB in the end (delta: -168.7MB). Peak memory consumption was 261.7MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 616.6MB. Free memory is still 262.9MB. 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 someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] double double_Array_0[1] = { 32.5 }; [L28-L30] float float_Array_0[2] = { 255.5, 255.5 }; [L31-L33] signed char signed_char_Array_0[1] = { 0 }; [L34-L36] unsigned char unsigned_char_Array_0[11] = { 5, 100, 128, 64, 100, 8, 50, 8, 32, 64, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 64 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][1]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[1]=348, float_Array_0[1]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [(float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F=1, float_Array_0[1]=348, float_Array_0[1]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [(float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F=1, float_Array_0[1]=348, float_Array_0[1]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_short_int_Array_0={9:0}] [L82] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1]=-130, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1]=-130, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1]=-130, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[1]=-130, unsigned_short_int_Array_0={9:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[2]=-514, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[2]=-514, unsigned_short_int_Array_0={9:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[2]=-514, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[2]=-514, unsigned_short_int_Array_0={9:0}] [L89] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L92] unsigned_char_Array_0[6] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[6]=-224, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[6] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[6]=-224, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[6]=-224, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[6]=-224, unsigned_short_int_Array_0={9:0}] [L95] unsigned_char_Array_0[7] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[7]=-192, unsigned_short_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[7] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[7]=-192, unsigned_short_int_Array_0={9:0}] [L97] EXPR unsigned_char_Array_0[7] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[7]=-192, unsigned_short_int_Array_0={9:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[7] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[7]=-192, unsigned_short_int_Array_0={9:0}] [L98] unsigned_char_Array_0[8] = __VERIFIER_nondet_uchar() [L99] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[8]=-449, unsigned_short_int_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[8] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[8]=-449, unsigned_short_int_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[8] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[8]=-449, unsigned_short_int_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[8] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[8]=-449, unsigned_short_int_Array_0={9:0}] [L101] unsigned_char_Array_0[9] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[9]=318, unsigned_short_int_Array_0={9:0}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[9] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[9]=318, unsigned_short_int_Array_0={9:0}] [L103] EXPR unsigned_char_Array_0[9] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[9]=318, unsigned_short_int_Array_0={9:0}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[9] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[9]=318, unsigned_short_int_Array_0={9:0}] [L104] unsigned_char_Array_0[10] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[10]=-193, unsigned_short_int_Array_0={9:0}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[10] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[10]=-193, unsigned_short_int_Array_0={9:0}] [L106] EXPR unsigned_char_Array_0[10] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[10]=-193, unsigned_short_int_Array_0={9:0}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[10] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[10]=-193, unsigned_short_int_Array_0={9:0}] [L119] RET updateVariables() [L120] CALL step() [L43] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_char_Array_0[3] [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_char_Array_0[1]=-130, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[0] [L44] EXPR ((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1]) VAL [((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])=127, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0[0]=-385, unsigned_char_Array_0[0]=-385, unsigned_char_Array_0[1]=-130, unsigned_char_Array_0[3]=-897, unsigned_short_int_Array_0={9:0}] [L44] unsigned_char_Array_0[4] = (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))) [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1]=1, BOOL_unsigned_char_Array_0[0][0]=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1]; [L49] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1][0]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1][0] || stepLocal_0 [L50] EXPR unsigned_char_Array_0[9] [L50] signed_char_Array_0[0] = unsigned_char_Array_0[9] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR unsigned_char_Array_0[10] [L53] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[10] [L54] double_Array_0[0] = 0.010000000000000009 [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < float_Array_0[0]) [L58] EXPR float_Array_0[0] [L58] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE float_Array_0[0] >= float_Array_0[0] [L59] EXPR BOOL_unsigned_char_Array_0[1][0] [L59] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L64] EXPR double_Array_0[0] [L64] EXPR float_Array_0[0] [L64] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=10000000000000009/1000000000000000000, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) [L64] EXPR float_Array_0[0] [L64] EXPR ((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0]) VAL [((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])=348, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=10000000000000009/1000000000000000000, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) [L111] EXPR float_Array_0[0] [L111] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) [L111] EXPR BOOL_unsigned_char_Array_0[1][1] [L111] EXPR BOOL_unsigned_char_Array_0[0][0] [L111] EXPR (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])) VAL [(float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))) VAL [(float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1) VAL [((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10]))))) VAL [(((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))=0, ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1) VAL [((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)=0, (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))=0, ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [(((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))=0, ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)=0, (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))=0, ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10])) VAL [((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))=0, (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))=0, ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)=0, (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))=0, ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111] EXPR (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) VAL [(((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009))=0, ((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))=0, (((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))=0, ((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)=0, (((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))=0, ((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)=0, (float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))=0, (float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0]))=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0][0]=1, BOOL_unsigned_char_Array_0[1][1]=-256, double_Array_0={5:0}, float_Array_0={6:0}, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, float_Array_0[0]=348, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L111-L112] return (((((((float_Array_0[0] < float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[0][0])))) && ((double_Array_0[0] < ((((float_Array_0[0]) > (float_Array_0[0])) ? (float_Array_0[0]) : (float_Array_0[0])))) ? (unsigned_char_Array_0[5] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[3]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_char_Array_0[4] == ((unsigned char) (unsigned_char_Array_0[3] + ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[4] == ((unsigned char) (((64 + unsigned_char_Array_0[8]) + (unsigned_char_Array_0[9] + unsigned_char_Array_0[6])) - (unsigned_char_Array_0[7] + unsigned_char_Array_0[10])))))) && ((BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[0][0] || BOOL_unsigned_char_Array_0[0][1])) ? (signed_char_Array_0[0] == ((signed char) unsigned_char_Array_0[9])) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[10]))) && (double_Array_0[0] == ((double) 0.010000000000000009)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.1s, OverallIterations: 15, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3708 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3675 mSDsluCounter, 8122 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6320 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8973 IncrementalHoareTripleChecker+Invalid, 9243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 1802 mSDtfsCounter, 8973 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1685 GetRequests, 1470 SyntacticMatches, 4 SemanticMatches, 211 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=10, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 722 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 39.1s InterpolantComputationTime, 3430 NumberOfCodeBlocks, 3430 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3221 ConstructedInterpolants, 0 QuantifiedInterpolants, 30250 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1883 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 19554/20400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:22:04,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:07,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:07,811 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:22:07,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:07,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:07,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:07,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:07,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:07,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:07,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:07,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:07,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:07,849 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:07,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:07,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:22:07,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:22:07,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:22:07,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:07,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:22:07,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:07,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:22:07,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:22:07,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:22:07,857 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:22:07,857 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:22:07,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:22:07,858 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:07,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:07,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:07,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:07,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:07,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:07,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:07,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:22:07,862 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:22:07,862 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:22:07,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:07,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:22:07,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:07,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:07,863 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:22:07,864 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:07,864 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_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9d4c4ba5fceaa6bfb2098951964c33b59994f146ab7abe517b65f1a8d594c6fc [2023-11-06 22:22:08,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:08,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:08,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:08,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:08,310 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:08,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:22:11,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:12,055 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:12,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:22:12,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/f975a3c68/98ba3bfbb38b48ef9f66570393d995ba/FLAGb0a0b0137 [2023-11-06 22:22:12,092 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/data/f975a3c68/98ba3bfbb38b48ef9f66570393d995ba [2023-11-06 22:22:12,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:12,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:12,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:12,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:12,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:12,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4b32e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12, skipping insertion in model container [2023-11-06 22:22:12,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,158 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:12,355 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-06 22:22:12,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:12,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:12,494 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-61.i[916,929] [2023-11-06 22:22:12,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:12,611 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:12,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12 WrapperNode [2023-11-06 22:22:12,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:12,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:12,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:12,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:12,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,722 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2023-11-06 22:22:12,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:12,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:12,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:12,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:12,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:12,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:12,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:12,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:12,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (1/1) ... [2023-11-06 22:22:12,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:12,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:22:12,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:22:12,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:22:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:22:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:22:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:22:12,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:22:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:22:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:22:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:22:12,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:22:12,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:22:12,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:22:12,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:22:12,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:12,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:12,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:22:12,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:22:13,025 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:13,027 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:14,079 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:14,086 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:14,087 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:22:14,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:14 BoogieIcfgContainer [2023-11-06 22:22:14,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:14,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:14,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:14,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:14,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:12" (1/3) ... [2023-11-06 22:22:14,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0925a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:14, skipping insertion in model container [2023-11-06 22:22:14,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:12" (2/3) ... [2023-11-06 22:22:14,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0925a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:14, skipping insertion in model container [2023-11-06 22:22:14,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:14" (3/3) ... [2023-11-06 22:22:14,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-61.i [2023-11-06 22:22:14,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:14,120 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:22:14,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:22:14,191 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@56abd2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:22:14,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:22:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:22:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:22:14,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:22:14,223 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:22:14,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:22:14,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:22:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1550515261, now seen corresponding path program 1 times [2023-11-06 22:22:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:22:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371065014] [2023-11-06 22:22:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:22:14,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:22:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:22:14,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:22:14,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:22:14,614 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 22:22:14,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 22:22:14,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:22:14,815 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:22:14,820 INFO L158 Benchmark]: Toolchain (without parser) took 2717.53ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 44.8MB in the beginning and 71.7MB in the end (delta: -26.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:22:14,820 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 73.4MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:14,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.36ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 44.7MB in the beginning and 81.9MB in the end (delta: -37.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-11-06 22:22:14,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.97ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 78.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:22:14,822 INFO L158 Benchmark]: Boogie Preprocessor took 81.78ms. Allocated memory is still 109.1MB. Free memory was 78.2MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:22:14,823 INFO L158 Benchmark]: RCFGBuilder took 1283.86ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 67.8MB in the end (delta: 6.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2023-11-06 22:22:14,828 INFO L158 Benchmark]: TraceAbstraction took 726.13ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 71.7MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:22:14,836 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.36ms. Allocated memory is still 73.4MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.36ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 44.7MB in the beginning and 81.9MB in the end (delta: -37.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.97ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 78.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.78ms. Allocated memory is still 109.1MB. Free memory was 78.2MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1283.86ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 67.8MB in the end (delta: 6.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 726.13ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 71.7MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:22:14,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9163027e-4aba-43de-8a88-23a71d684d3f/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.