./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.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_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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 fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:34,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:34,243 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:10:34,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:34,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:34,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:34,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:34,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:34,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:34,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:34,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:34,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:34,289 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:34,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:34,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:34,292 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:34,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:34,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:34,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:34,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:34,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:34,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:34,296 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:34,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:34,297 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:34,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:34,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:34,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:34,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:34,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:34,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:34,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:34,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:34,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:34,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:34,303 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:34,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:34,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:34,305 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:34,305 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_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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 -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2023-11-06 22:10:34,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:34,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:34,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:34,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:34,672 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:34,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:10:38,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:38,352 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:38,353 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:10:38,368 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/401ef495e/9979dca1c80843289bb20807b425c22d/FLAG0520c5e4e [2023-11-06 22:10:38,394 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/401ef495e/9979dca1c80843289bb20807b425c22d [2023-11-06 22:10:38,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:38,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:38,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:38,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:38,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:38,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763afd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38, skipping insertion in model container [2023-11-06 22:10:38,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,453 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:38,640 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_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i[916,929] [2023-11-06 22:10:38,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:38,742 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:38,766 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_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i[916,929] [2023-11-06 22:10:38,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:38,854 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:38,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38 WrapperNode [2023-11-06 22:10:38,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:38,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:38,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:38,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:38,867 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:10:38" (1/1) ... [2023-11-06 22:10:38,889 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:10:38" (1/1) ... [2023-11-06 22:10:38,937 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2023-11-06 22:10:38,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:38,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:38,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:38,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:38,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:38,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:39,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:39,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:39,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:39,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:39,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:39,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:39,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:39,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (1/1) ... [2023-11-06 22:10:39,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:39,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:10:39,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:10:39,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:10:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:10:39,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:10:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:10:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:10:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:10:39,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:10:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:39,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:39,341 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:39,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:40,162 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:40,173 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:40,173 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:10:40,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:40 BoogieIcfgContainer [2023-11-06 22:10:40,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:40,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:40,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:40,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:40,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:38" (1/3) ... [2023-11-06 22:10:40,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aff55d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:40, skipping insertion in model container [2023-11-06 22:10:40,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:38" (2/3) ... [2023-11-06 22:10:40,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aff55d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:40, skipping insertion in model container [2023-11-06 22:10:40,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:40" (3/3) ... [2023-11-06 22:10:40,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:10:40,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:40,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:40,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:40,321 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;@37c01479, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:40,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:10:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:40,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:40,357 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:40,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:40,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -189417813, now seen corresponding path program 1 times [2023-11-06 22:10:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076808813] [2023-11-06 22:10:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076808813] [2023-11-06 22:10:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076808813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338268169] [2023-11-06 22:10:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:40,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:10:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:40,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:10:40,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:40,992 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:41,042 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-11-06 22:10:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:10:41,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-06 22:10:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:41,057 INFO L225 Difference]: With dead ends: 209 [2023-11-06 22:10:41,058 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:10:41,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:10:41,071 INFO L413 NwaCegarLoop]: 152 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, 152 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:10:41,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:10:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-06 22:10:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-11-06 22:10:41,145 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2023-11-06 22:10:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:41,146 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-11-06 22:10:41,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-11-06 22:10:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:41,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:41,152 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:41,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:41,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:41,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1718415183, now seen corresponding path program 1 times [2023-11-06 22:10:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748016392] [2023-11-06 22:10:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748016392] [2023-11-06 22:10:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748016392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932752650] [2023-11-06 22:10:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:41,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:41,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:41,625 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:41,727 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2023-11-06 22:10:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 22:10:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:41,737 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:10:41,738 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:10:41,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:10:41,743 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 21 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:41,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 443 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:10:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-11-06 22:10:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-11-06 22:10:41,768 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2023-11-06 22:10:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:41,772 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-11-06 22:10:41,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-11-06 22:10:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:41,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:41,778 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:10:41,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:41,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1896493743, now seen corresponding path program 1 times [2023-11-06 22:10:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298422405] [2023-11-06 22:10:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298422405] [2023-11-06 22:10:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298422405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515892467] [2023-11-06 22:10:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:42,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:42,205 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:42,249 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2023-11-06 22:10:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 22:10:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:42,252 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:10:42,253 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:10:42,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:10:42,255 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 12 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 441 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:10:42,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 441 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:10:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-06 22:10:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-11-06 22:10:42,270 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2023-11-06 22:10:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-11-06 22:10:42,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-11-06 22:10:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:42,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:42,275 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:10:42,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:42,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -121486381, now seen corresponding path program 1 times [2023-11-06 22:10:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476920989] [2023-11-06 22:10:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476920989] [2023-11-06 22:10:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476920989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539526938] [2023-11-06 22:10:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:42,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:42,567 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:42,622 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2023-11-06 22:10:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:42,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 22:10:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:42,627 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:10:42,627 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:10:42,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:10:42,640 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 440 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:10:42,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:10:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-06 22:10:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-11-06 22:10:42,661 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2023-11-06 22:10:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:42,663 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-11-06 22:10:42,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-11-06 22:10:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:42,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:42,672 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:10:42,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:42,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash -119639339, now seen corresponding path program 1 times [2023-11-06 22:10:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700766821] [2023-11-06 22:10:42,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700766821] [2023-11-06 22:10:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700766821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:43,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:43,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437021063] [2023-11-06 22:10:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:43,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:43,054 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:43,318 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2023-11-06 22:10:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-06 22:10:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:43,321 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:10:43,321 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:10:43,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:43,329 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 5 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:43,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 473 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:10:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:10:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 22:10:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2023-11-06 22:10:43,352 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2023-11-06 22:10:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:43,353 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2023-11-06 22:10:43,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2023-11-06 22:10:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:10:43,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:43,356 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:10:43,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:43,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1808583081, now seen corresponding path program 1 times [2023-11-06 22:10:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:43,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359879521] [2023-11-06 22:10:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359879521] [2023-11-06 22:10:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359879521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:45,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:45,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:10:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291188389] [2023-11-06 22:10:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:45,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:10:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:10:45,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:45,047 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:45,736 INFO L93 Difference]: Finished difference Result 313 states and 448 transitions. [2023-11-06 22:10:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:10:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-11-06 22:10:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:45,739 INFO L225 Difference]: With dead ends: 313 [2023-11-06 22:10:45,739 INFO L226 Difference]: Without dead ends: 204 [2023-11-06 22:10:45,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:10:45,741 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 340 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:45,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 534 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:10:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-06 22:10:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 124. [2023-11-06 22:10:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2023-11-06 22:10:45,759 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 131 [2023-11-06 22:10:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:45,760 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2023-11-06 22:10:45,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2023-11-06 22:10:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:10:45,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:45,773 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:10:45,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:45,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:45,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1179853069, now seen corresponding path program 1 times [2023-11-06 22:10:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:45,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865043134] [2023-11-06 22:10:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865043134] [2023-11-06 22:10:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865043134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:46,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511507602] [2023-11-06 22:10:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:46,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:46,418 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:46,505 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2023-11-06 22:10:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 22:10:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:46,507 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:10:46,508 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:10:46,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:10:46,510 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 106 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:46,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 271 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:10:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:10:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-06 22:10:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2023-11-06 22:10:46,532 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 133 [2023-11-06 22:10:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:46,535 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2023-11-06 22:10:46,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2023-11-06 22:10:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:10:46,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:46,541 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:10:46,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:46,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1602554895, now seen corresponding path program 1 times [2023-11-06 22:10:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657272191] [2023-11-06 22:10:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:46,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657272191] [2023-11-06 22:10:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657272191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352695214] [2023-11-06 22:10:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:46,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:46,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:46,952 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:47,163 INFO L93 Difference]: Finished difference Result 239 states and 341 transitions. [2023-11-06 22:10:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 22:10:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:47,168 INFO L225 Difference]: With dead ends: 239 [2023-11-06 22:10:47,168 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:10:47,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:47,172 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 464 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:10:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:10:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:10:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2023-11-06 22:10:47,196 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 133 [2023-11-06 22:10:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:47,196 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2023-11-06 22:10:47,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2023-11-06 22:10:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:10:47,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:47,200 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:10:47,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:47,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1452665586, now seen corresponding path program 1 times [2023-11-06 22:10:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237533207] [2023-11-06 22:10:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237533207] [2023-11-06 22:10:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237533207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912359096] [2023-11-06 22:10:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:47,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:47,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:47,378 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:47,430 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2023-11-06 22:10:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:47,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 22:10:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:47,433 INFO L225 Difference]: With dead ends: 285 [2023-11-06 22:10:47,433 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 22:10:47,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:47,436 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:47,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 22:10:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 129. [2023-11-06 22:10:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2023-11-06 22:10:47,453 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 133 [2023-11-06 22:10:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:47,454 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2023-11-06 22:10:47,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2023-11-06 22:10:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:10:47,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:47,457 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:10:47,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:47,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1301671051, now seen corresponding path program 1 times [2023-11-06 22:10:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071413463] [2023-11-06 22:10:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071413463] [2023-11-06 22:10:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071413463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:47,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920392726] [2023-11-06 22:10:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:47,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:47,835 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:47,902 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2023-11-06 22:10:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 22:10:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:47,908 INFO L225 Difference]: With dead ends: 276 [2023-11-06 22:10:47,909 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 22:10:47,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:47,910 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:47,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 547 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 22:10:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2023-11-06 22:10:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions. [2023-11-06 22:10:47,930 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 133 [2023-11-06 22:10:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:47,931 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 181 transitions. [2023-11-06 22:10:47,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions. [2023-11-06 22:10:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:10:47,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:47,935 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:10:47,936 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:47,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1819401392, now seen corresponding path program 1 times [2023-11-06 22:10:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870574599] [2023-11-06 22:10:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:48,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870574599] [2023-11-06 22:10:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870574599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946192624] [2023-11-06 22:10:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:48,109 INFO L87 Difference]: Start difference. First operand 132 states and 181 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:48,152 INFO L93 Difference]: Finished difference Result 303 states and 415 transitions. [2023-11-06 22:10:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-06 22:10:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:48,156 INFO L225 Difference]: With dead ends: 303 [2023-11-06 22:10:48,156 INFO L226 Difference]: Without dead ends: 174 [2023-11-06 22:10:48,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:48,158 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:48,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-06 22:10:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2023-11-06 22:10:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 114 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2023-11-06 22:10:48,177 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 133 [2023-11-06 22:10:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:48,178 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2023-11-06 22:10:48,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2023-11-06 22:10:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:10:48,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:48,181 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:10:48,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:48,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 770219029, now seen corresponding path program 1 times [2023-11-06 22:10:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507366361] [2023-11-06 22:10:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507366361] [2023-11-06 22:10:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507366361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013877460] [2023-11-06 22:10:48,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:48,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:48,642 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:48,869 INFO L93 Difference]: Finished difference Result 265 states and 363 transitions. [2023-11-06 22:10:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-06 22:10:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:48,871 INFO L225 Difference]: With dead ends: 265 [2023-11-06 22:10:48,872 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:10:48,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:10:48,873 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:48,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 445 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:10:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:10:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2023-11-06 22:10:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:10:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2023-11-06 22:10:48,889 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 134 [2023-11-06 22:10:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:48,890 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2023-11-06 22:10:48,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2023-11-06 22:10:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 22:10:48,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:48,893 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:10:48,894 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:48,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 432299787, now seen corresponding path program 1 times [2023-11-06 22:10:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589221488] [2023-11-06 22:10:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589221488] [2023-11-06 22:10:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589221488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:49,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695910069] [2023-11-06 22:10:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:49,169 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:49,363 INFO L93 Difference]: Finished difference Result 378 states and 509 transitions. [2023-11-06 22:10:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-06 22:10:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:49,370 INFO L225 Difference]: With dead ends: 378 [2023-11-06 22:10:49,370 INFO L226 Difference]: Without dead ends: 249 [2023-11-06 22:10:49,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:10:49,373 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 98 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 357 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:10:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-06 22:10:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 186. [2023-11-06 22:10:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 150 states have internal predecessors, (188), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:10:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 252 transitions. [2023-11-06 22:10:49,414 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 252 transitions. Word has length 135 [2023-11-06 22:10:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:49,415 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 252 transitions. [2023-11-06 22:10:49,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 252 transitions. [2023-11-06 22:10:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:10:49,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:49,417 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:49,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:10:49,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:49,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1710753666, now seen corresponding path program 1 times [2023-11-06 22:10:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804865679] [2023-11-06 22:10:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804865679] [2023-11-06 22:10:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804865679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:49,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704200289] [2023-11-06 22:10:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:49,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:49,643 INFO L87 Difference]: Start difference. First operand 186 states and 252 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:49,722 INFO L93 Difference]: Finished difference Result 406 states and 549 transitions. [2023-11-06 22:10:49,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:49,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 22:10:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:49,727 INFO L225 Difference]: With dead ends: 406 [2023-11-06 22:10:49,728 INFO L226 Difference]: Without dead ends: 277 [2023-11-06 22:10:49,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:10:49,729 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 118 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:49,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-06 22:10:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 191. [2023-11-06 22:10:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 155 states have (on average 1.264516129032258) internal successors, (196), 155 states have internal predecessors, (196), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:10:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 260 transitions. [2023-11-06 22:10:49,771 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 260 transitions. Word has length 136 [2023-11-06 22:10:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:49,771 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 260 transitions. [2023-11-06 22:10:49,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 260 transitions. [2023-11-06 22:10:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:10:49,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:49,775 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:10:49,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:49,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 689685312, now seen corresponding path program 1 times [2023-11-06 22:10:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732722439] [2023-11-06 22:10:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:50,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732722439] [2023-11-06 22:10:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732722439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981436211] [2023-11-06 22:10:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:50,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:50,057 INFO L87 Difference]: Start difference. First operand 191 states and 260 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:50,168 INFO L93 Difference]: Finished difference Result 365 states and 498 transitions. [2023-11-06 22:10:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:10:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 22:10:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:50,171 INFO L225 Difference]: With dead ends: 365 [2023-11-06 22:10:50,171 INFO L226 Difference]: Without dead ends: 231 [2023-11-06 22:10:50,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:10:50,174 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 104 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:50,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 712 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-06 22:10:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2023-11-06 22:10:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 156 states have internal predecessors, (197), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:10:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2023-11-06 22:10:50,200 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 136 [2023-11-06 22:10:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:50,201 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2023-11-06 22:10:50,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2023-11-06 22:10:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:10:50,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:50,205 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:10:50,205 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:50,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1268270000, now seen corresponding path program 1 times [2023-11-06 22:10:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:50,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383966277] [2023-11-06 22:10:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:50,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383966277] [2023-11-06 22:10:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383966277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921875143] [2023-11-06 22:10:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:50,628 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:50,656 INFO L93 Difference]: Finished difference Result 327 states and 445 transitions. [2023-11-06 22:10:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-06 22:10:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:50,661 INFO L225 Difference]: With dead ends: 327 [2023-11-06 22:10:50,661 INFO L226 Difference]: Without dead ends: 192 [2023-11-06 22:10:50,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:50,662 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:50,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-06 22:10:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-11-06 22:10:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 156 states have (on average 1.25) internal successors, (195), 156 states have internal predecessors, (195), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:10:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2023-11-06 22:10:50,691 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 136 [2023-11-06 22:10:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:50,691 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2023-11-06 22:10:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2023-11-06 22:10:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:10:50,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:50,694 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:50,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:10:50,694 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:50,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1487124718, now seen corresponding path program 1 times [2023-11-06 22:10:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884261649] [2023-11-06 22:10:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884261649] [2023-11-06 22:10:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884261649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:10:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642628284] [2023-11-06 22:10:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:10:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:10:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:10:52,304 INFO L87 Difference]: Start difference. First operand 192 states and 259 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:52,925 INFO L93 Difference]: Finished difference Result 387 states and 519 transitions. [2023-11-06 22:10:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2023-11-06 22:10:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:52,929 INFO L225 Difference]: With dead ends: 387 [2023-11-06 22:10:52,929 INFO L226 Difference]: Without dead ends: 252 [2023-11-06 22:10:52,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:10:52,930 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 413 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:52,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 440 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:10:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-06 22:10:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 241. [2023-11-06 22:10:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 197 states have internal predecessors, (246), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 22:10:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 326 transitions. [2023-11-06 22:10:52,967 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 326 transitions. Word has length 136 [2023-11-06 22:10:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:52,969 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 326 transitions. [2023-11-06 22:10:52,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:10:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 326 transitions. [2023-11-06 22:10:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:10:52,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:52,971 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:52,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:10:52,972 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:52,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1758653802, now seen corresponding path program 1 times [2023-11-06 22:10:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043274133] [2023-11-06 22:10:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:10:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:10:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:10:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:10:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:10:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:10:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:10:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:10:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:10:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:10:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:10:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:10:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:10:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:10:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043274133] [2023-11-06 22:10:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043274133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764171318] [2023-11-06 22:10:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:53,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:53,561 INFO L87 Difference]: Start difference. First operand 241 states and 326 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:53,892 INFO L93 Difference]: Finished difference Result 340 states and 464 transitions. [2023-11-06 22:10:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-06 22:10:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:53,898 INFO L225 Difference]: With dead ends: 340 [2023-11-06 22:10:53,898 INFO L226 Difference]: Without dead ends: 338 [2023-11-06 22:10:53,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:53,899 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:53,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 838 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:10:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-06 22:10:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 247. [2023-11-06 22:10:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 202 states have (on average 1.2475247524752475) internal successors, (252), 203 states have internal predecessors, (252), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 22:10:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 332 transitions. [2023-11-06 22:10:53,948 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 332 transitions. Word has length 137 [2023-11-06 22:10:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:53,949 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 332 transitions. [2023-11-06 22:10:53,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:10:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 332 transitions. [2023-11-06 22:10:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:10:53,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:53,951 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:10:53,952 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:53,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1756806760, now seen corresponding path program 1 times [2023-11-06 22:10:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146119098] [2023-11-06 22:10:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:10:54,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:10:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:10:54,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:10:54,413 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:10:54,415 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:10:54,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:10:54,423 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:54,430 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:10:54,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:10:54 BoogieIcfgContainer [2023-11-06 22:10:54,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:10:54,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:10:54,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:10:54,626 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:10:54,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:40" (3/4) ... [2023-11-06 22:10:54,629 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:10:54,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:10:54,632 INFO L158 Benchmark]: Toolchain (without parser) took 16230.39ms. Allocated memory was 125.8MB in the beginning and 379.6MB in the end (delta: 253.8MB). Free memory was 86.5MB in the beginning and 296.4MB in the end (delta: -209.9MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,632 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:10:54,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.74ms. Allocated memory is still 125.8MB. Free memory was 86.3MB in the beginning and 72.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.38ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 67.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,634 INFO L158 Benchmark]: Boogie Preprocessor took 105.35ms. Allocated memory is still 125.8MB. Free memory was 67.9MB in the beginning and 64.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,634 INFO L158 Benchmark]: RCFGBuilder took 1133.14ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 64.4MB in the beginning and 113.5MB in the end (delta: -49.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,635 INFO L158 Benchmark]: TraceAbstraction took 14441.03ms. Allocated memory was 165.7MB in the beginning and 379.6MB in the end (delta: 213.9MB). Free memory was 112.7MB in the beginning and 297.4MB in the end (delta: -184.7MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,641 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 379.6MB. Free memory was 297.4MB in the beginning and 296.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:54,647 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.74ms. Allocated memory is still 125.8MB. Free memory was 86.3MB in the beginning and 72.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.38ms. Allocated memory is still 125.8MB. Free memory was 71.8MB in the beginning and 67.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.35ms. Allocated memory is still 125.8MB. Free memory was 67.9MB in the beginning and 64.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.14ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 64.4MB in the beginning and 113.5MB in the end (delta: -49.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14441.03ms. Allocated memory was 165.7MB in the beginning and 379.6MB in the end (delta: 213.9MB). Free memory was 112.7MB in the beginning and 297.4MB in the end (delta: -184.7MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 5.58ms. Allocated memory is still 379.6MB. Free memory was 297.4MB in the beginning and 296.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L28-L30] float float_Array_0[1] = { 99999.25 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -1000000000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_3_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[3] [L98] last_1_BOOL_unsigned_char_Array_0_3_ = BOOL_unsigned_char_Array_0[3] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=512, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=512, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=512, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=512, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-255, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[2]=-256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=100004, double_Array_0[0]=100004, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [(double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=100004, double_Array_0[0]=100004, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [(double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=100004, double_Array_0[0]=100004, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] double_Array_0[2] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2]=100011, double_Array_0[2]=100011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [(double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F=1, double_Array_0[2]=100011, double_Array_0[2]=100011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [(double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F=1, double_Array_0[2]=100011, double_Array_0[2]=100011, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_char_Array_0[1]=126, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_char_Array_0[1]=126, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_char_Array_0[1]=126, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_char_Array_0[1]=126, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2] [L93] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=10] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=10] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=10] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[1]=10] [L109] RET updateVariables() [L110] CALL step() [L44] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_3_) [L47] EXPR unsigned_short_int_Array_0[0] [L47] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L49] EXPR BOOL_unsigned_char_Array_0[2] [L49] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L50] BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[4]) [L59] EXPR unsigned_short_int_Array_0[2] [L59] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[2] [L60] EXPR double_Array_0[0] [L60] float_Array_0[0] = double_Array_0[0] [L61] EXPR signed_char_Array_0[1] [L61] signed_char_Array_0[0] = signed_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L62] EXPR signed_long_int_Array_0[0] VAL [((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, stepLocal_0=0, unsigned_short_int_Array_0={9:0}] [L62] COND FALSE !(((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) [L101] EXPR BOOL_unsigned_char_Array_0[4] VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1 VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) [L101] EXPR signed_long_int_Array_0[0] VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR signed_long_int_Array_0[0] VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1 VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))=1, (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) [L101] EXPR float_Array_0[0] [L101] EXPR double_Array_0[0] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))=1, (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, double_Array_0[0]=100004, float_Array_0={6:0}, float_Array_0[0]=100004, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2, unsigned_short_int_Array_0[2]=-2] [L101] EXPR ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [(! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))=1, ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)=1, (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)=1, ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))=1, (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))=0, ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))=0, (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1=1, ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])=65534, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1=1, BOOL_unsigned_char_Array_0[4]=256, double_Array_0={5:0}, double_Array_0[0]=100004, float_Array_0={6:0}, float_Array_0[0]=100004, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, signed_long_int_Array_0[0]=65534, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0[0]=-2, unsigned_short_int_Array_0[2]=-2, unsigned_short_int_Array_0[2]=-2] [L101-L102] return ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L111] RET, EXPR property() [L111] 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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_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, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1544 mSDsluCounter, 7913 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5194 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 2719 mSDtfsCounter, 1604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=18, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 491 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2538 NumberOfCodeBlocks, 2538 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2383 ConstructedInterpolants, 0 QuantifiedInterpolants, 5109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 8640/8640 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:10:54,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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 fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:57,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:57,675 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:10:57,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:57,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:57,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:57,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:57,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:57,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:57,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:57,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:57,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:57,744 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:57,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:57,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:57,747 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:57,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:57,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:57,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:57,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:57,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:57,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:10:57,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:10:57,752 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:10:57,752 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:57,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:57,753 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:57,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:57,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:57,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:57,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:57,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:57,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:57,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:57,758 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:10:57,758 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:10:57,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:57,758 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:57,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:57,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:57,760 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:10:57,760 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:57,761 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_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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 -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2023-11-06 22:10:58,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:58,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:58,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:58,252 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:58,253 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:58,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:11:01,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:11:01,743 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:11:01,744 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:11:01,756 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/ca9c9ca45/43f70e1bb4ba4653bcffb216a602773b/FLAGd5a844405 [2023-11-06 22:11:01,776 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/data/ca9c9ca45/43f70e1bb4ba4653bcffb216a602773b [2023-11-06 22:11:01,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:11:01,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:11:01,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:01,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:11:01,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:11:01,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:01" (1/1) ... [2023-11-06 22:11:01,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcc3936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:01, skipping insertion in model container [2023-11-06 22:11:01,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:01" (1/1) ... [2023-11-06 22:11:01,842 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:11:02,027 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_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i[916,929] [2023-11-06 22:11:02,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:02,129 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:11:02,142 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_208cbd31-f999-4373-acc2-a252328159f9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i[916,929] [2023-11-06 22:11:02,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:02,229 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:11:02,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02 WrapperNode [2023-11-06 22:11:02,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:02,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:02,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:11:02,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:11:02,261 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:11:02" (1/1) ... [2023-11-06 22:11:02,284 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:11:02" (1/1) ... [2023-11-06 22:11:02,363 INFO L138 Inliner]: procedures = 39, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2023-11-06 22:11:02,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:02,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:11:02,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:11:02,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:11:02,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:11:02,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:11:02,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:11:02,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:11:02,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (1/1) ... [2023-11-06 22:11:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:02,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:02,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:11:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:11:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:11:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:11:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:11:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:11:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:11:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:11:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:11:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:11:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:11:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:11:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:11:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:11:02,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:11:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:11:02,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:11:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:11:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:11:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:11:02,755 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:11:02,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:11:04,723 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:11:04,733 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:11:04,733 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:11:04,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:04 BoogieIcfgContainer [2023-11-06 22:11:04,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:11:04,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:11:04,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:11:04,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:11:04,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:11:01" (1/3) ... [2023-11-06 22:11:04,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9176e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:04, skipping insertion in model container [2023-11-06 22:11:04,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:02" (2/3) ... [2023-11-06 22:11:04,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9176e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:04, skipping insertion in model container [2023-11-06 22:11:04,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:04" (3/3) ... [2023-11-06 22:11:04,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2023-11-06 22:11:04,773 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:11:04,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:11:04,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:11:04,852 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;@39f9a9ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:11:04,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:11:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:11:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:11:04,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:04,876 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:04,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:04,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1693081771, now seen corresponding path program 1 times [2023-11-06 22:11:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:11:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935975396] [2023-11-06 22:11:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:04,902 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:11:04,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:11:04,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:04,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:05,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:05,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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:11:05,409 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_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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:11:05,414 INFO L158 Benchmark]: Toolchain (without parser) took 3627.71ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 53.6MB in the beginning and 60.6MB in the end (delta: -7.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2023-11-06 22:11:05,414 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:11:05,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.95ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 37.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:11:05,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.89ms. Allocated memory is still 77.6MB. Free memory was 37.9MB in the beginning and 53.8MB in the end (delta: -15.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:11:05,416 INFO L158 Benchmark]: Boogie Preprocessor took 135.47ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 49.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:11:05,417 INFO L158 Benchmark]: RCFGBuilder took 2236.64ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 49.8MB in the beginning and 57.0MB in the end (delta: -7.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-11-06 22:11:05,422 INFO L158 Benchmark]: TraceAbstraction took 671.34ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 60.6MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:11:05,436 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.18ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.95ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 37.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.89ms. Allocated memory is still 77.6MB. Free memory was 37.9MB in the beginning and 53.8MB in the end (delta: -15.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.47ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 49.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2236.64ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 49.8MB in the beginning and 57.0MB in the end (delta: -7.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 671.34ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 60.6MB in the end (delta: -4.5MB). 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_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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:11:05,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_208cbd31-f999-4373-acc2-a252328159f9/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_208cbd31-f999-4373-acc2-a252328159f9/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.