./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:24:15,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:24:16,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:24:16,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:24:16,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:24:16,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:24:16,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:24:16,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:24:16,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:24:16,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:24:16,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:24:16,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:24:16,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:24:16,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:24:16,125 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:24:16,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:24:16,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:24:16,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:24:16,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:24:16,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:24:16,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:24:16,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:24:16,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:24:16,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:24:16,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:24:16,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:24:16,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:24:16,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:24:16,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:24:16,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:24:16,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:24:16,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:24:16,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:16,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:24:16,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:24:16,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:24:16,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:24:16,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:24:16,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:24:16,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:24:16,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:24:16,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:24:16,134 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-10-24 11:24:16,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:24:16,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:24:16,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:24:16,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:24:16,374 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:24:16,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:24:17,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:24:17,993 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:24:17,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:24:18,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c640239/d2fe8cc457cc475bbedb972a6e6d8cbc/FLAG779abe89d [2024-10-24 11:24:18,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c640239/d2fe8cc457cc475bbedb972a6e6d8cbc [2024-10-24 11:24:18,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:24:18,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:24:18,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:18,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:24:18,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:24:18,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777b8231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18, skipping insertion in model container [2024-10-24 11:24:18,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:24:18,241 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-10-24 11:24:18,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:18,335 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:24:18,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-10-24 11:24:18,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:18,395 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:24:18,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18 WrapperNode [2024-10-24 11:24:18,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:18,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:18,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:24:18,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:24:18,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,466 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-10-24 11:24:18,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:18,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:24:18,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:24:18,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:24:18,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,529 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-10-24 11:24:18,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:24:18,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:24:18,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:24:18,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:24:18,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (1/1) ... [2024-10-24 11:24:18,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:18,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:24:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:24:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:24:18,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:24:18,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:24:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:24:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:24:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:24:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:24:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:24:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:24:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:24:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:24:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:24:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:24:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:24:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:24:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:24:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:24:18,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:24:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:24:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:24:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:24:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:24:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:24:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:24:18,827 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:24:18,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:24:19,440 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-24 11:24:19,441 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:24:19,471 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:24:19,472 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:24:19,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:19 BoogieIcfgContainer [2024-10-24 11:24:19,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:24:19,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:24:19,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:24:19,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:24:19,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:24:18" (1/3) ... [2024-10-24 11:24:19,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762179c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:19, skipping insertion in model container [2024-10-24 11:24:19,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:18" (2/3) ... [2024-10-24 11:24:19,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762179c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:19, skipping insertion in model container [2024-10-24 11:24:19,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:19" (3/3) ... [2024-10-24 11:24:19,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:24:19,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:24:19,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:24:19,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:24:19,565 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57a8eae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:24:19,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:24:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:24:19,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:19,586 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:19,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1594979809, now seen corresponding path program 1 times [2024-10-24 11:24:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577540281] [2024-10-24 11:24:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577540281] [2024-10-24 11:24:19,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577540281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:19,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:19,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:24:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871867345] [2024-10-24 11:24:19,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:19,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:24:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:19,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:24:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:24:19,983 INFO L87 Difference]: Start difference. First operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:20,034 INFO L93 Difference]: Finished difference Result 191 states and 304 transitions. [2024-10-24 11:24:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:24:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-24 11:24:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:20,047 INFO L225 Difference]: With dead ends: 191 [2024-10-24 11:24:20,047 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 11:24:20,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:24:20,055 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:20,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 11:24:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-24 11:24:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-10-24 11:24:20,111 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 95 [2024-10-24 11:24:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:20,111 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-10-24 11:24:20,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-10-24 11:24:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:24:20,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:20,118 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:20,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:24:20,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:20,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash 485574325, now seen corresponding path program 1 times [2024-10-24 11:24:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:20,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623566458] [2024-10-24 11:24:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623566458] [2024-10-24 11:24:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623566458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:24:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179480830] [2024-10-24 11:24:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:20,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:24:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:24:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:20,513 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:20,574 INFO L93 Difference]: Finished difference Result 191 states and 286 transitions. [2024-10-24 11:24:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:24:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-24 11:24:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:20,577 INFO L225 Difference]: With dead ends: 191 [2024-10-24 11:24:20,577 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:24:20,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:20,579 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:20,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:24:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-24 11:24:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-24 11:24:20,597 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 95 [2024-10-24 11:24:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-24 11:24:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-24 11:24:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:24:20,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:20,605 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:24:20,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:20,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1543412403, now seen corresponding path program 1 times [2024-10-24 11:24:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914599769] [2024-10-24 11:24:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:20,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914599769] [2024-10-24 11:24:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914599769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990455126] [2024-10-24 11:24:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:24:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:24:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:20,809 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:20,851 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2024-10-24 11:24:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:24:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-24 11:24:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:20,855 INFO L225 Difference]: With dead ends: 194 [2024-10-24 11:24:20,855 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:24:20,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:20,859 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:20,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:24:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 11:24:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-10-24 11:24:20,875 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2024-10-24 11:24:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:20,875 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-10-24 11:24:20,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-10-24 11:24:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:24:20,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:20,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:20,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:24:20,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 956606389, now seen corresponding path program 1 times [2024-10-24 11:24:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:20,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869110755] [2024-10-24 11:24:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869110755] [2024-10-24 11:24:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869110755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:24:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305712911] [2024-10-24 11:24:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:21,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:24:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:24:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:21,071 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:21,110 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-10-24 11:24:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:24:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-24 11:24:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:21,113 INFO L225 Difference]: With dead ends: 197 [2024-10-24 11:24:21,113 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:24:21,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:21,115 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:21,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:24:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 11:24:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-10-24 11:24:21,129 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 95 [2024-10-24 11:24:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-10-24 11:24:21,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-10-24 11:24:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:24:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:21,131 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:24:21,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 212501495, now seen corresponding path program 1 times [2024-10-24 11:24:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695774708] [2024-10-24 11:24:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695774708] [2024-10-24 11:24:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695774708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439026402] [2024-10-24 11:24:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:24:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:24:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:21,300 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:21,407 INFO L93 Difference]: Finished difference Result 243 states and 359 transitions. [2024-10-24 11:24:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:24:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-24 11:24:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:21,410 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:24:21,411 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 11:24:21,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:21,412 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:21,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:24:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 11:24:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2024-10-24 11:24:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2024-10-24 11:24:21,430 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 98 [2024-10-24 11:24:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:21,431 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2024-10-24 11:24:21,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2024-10-24 11:24:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:24:21,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:21,432 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:21,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:24:21,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:21,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1169498578, now seen corresponding path program 1 times [2024-10-24 11:24:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913993578] [2024-10-24 11:24:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913993578] [2024-10-24 11:24:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913993578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124891961] [2024-10-24 11:24:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:24:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:24:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:21,536 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:21,560 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2024-10-24 11:24:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:24:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-24 11:24:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:21,563 INFO L225 Difference]: With dead ends: 236 [2024-10-24 11:24:21,563 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:24:21,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:24:21,565 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:21,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:24:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 11:24:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:24:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-10-24 11:24:21,578 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 98 [2024-10-24 11:24:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:21,578 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-10-24 11:24:21,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-10-24 11:24:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:24:21,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:21,580 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:24:21,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 360151952, now seen corresponding path program 1 times [2024-10-24 11:24:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617580328] [2024-10-24 11:24:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617580328] [2024-10-24 11:24:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617580328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:22,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:24:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343767818] [2024-10-24 11:24:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:24:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:24:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:24:22,505 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:22,922 INFO L93 Difference]: Finished difference Result 314 states and 460 transitions. [2024-10-24 11:24:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:24:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-24 11:24:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:22,925 INFO L225 Difference]: With dead ends: 314 [2024-10-24 11:24:22,926 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 11:24:22,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:24:22,927 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 250 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:22,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 651 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:24:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 11:24:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-10-24 11:24:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.4367816091954022) internal successors, (250), 175 states have internal predecessors, (250), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:24:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 282 transitions. [2024-10-24 11:24:22,951 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 282 transitions. Word has length 98 [2024-10-24 11:24:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 282 transitions. [2024-10-24 11:24:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:24:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2024-10-24 11:24:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:24:22,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:22,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:22,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:24:22,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:22,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1801927429, now seen corresponding path program 1 times [2024-10-24 11:24:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017052958] [2024-10-24 11:24:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:24:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255757674] [2024-10-24 11:24:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:23,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:23,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:24:23,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:24:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:23,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:24:23,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:24:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:23,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:24:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017052958] [2024-10-24 11:24:23,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:24:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255757674] [2024-10-24 11:24:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255757674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:24:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287843118] [2024-10-24 11:24:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:23,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:24:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:24:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:23,765 INFO L87 Difference]: Start difference. First operand 193 states and 282 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:23,981 INFO L93 Difference]: Finished difference Result 526 states and 771 transitions. [2024-10-24 11:24:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:24:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-24 11:24:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:23,985 INFO L225 Difference]: With dead ends: 526 [2024-10-24 11:24:23,985 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 11:24:23,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:24:23,987 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 129 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:23,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 348 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 11:24:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2024-10-24 11:24:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.4206008583690988) internal successors, (331), 234 states have internal predecessors, (331), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 387 transitions. [2024-10-24 11:24:24,019 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 387 transitions. Word has length 100 [2024-10-24 11:24:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:24,019 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 387 transitions. [2024-10-24 11:24:24,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 387 transitions. [2024-10-24 11:24:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:24:24,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:24,020 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:24,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:24:24,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:24,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:24,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1567745793, now seen corresponding path program 1 times [2024-10-24 11:24:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:24,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941689502] [2024-10-24 11:24:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941689502] [2024-10-24 11:24:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941689502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:24:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359681702] [2024-10-24 11:24:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:24,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:24:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:24:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:24:24,540 INFO L87 Difference]: Start difference. First operand 265 states and 387 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:24,799 INFO L93 Difference]: Finished difference Result 589 states and 851 transitions. [2024-10-24 11:24:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:24:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-24 11:24:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:24,804 INFO L225 Difference]: With dead ends: 589 [2024-10-24 11:24:24,804 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 11:24:24,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:24:24,805 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 79 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:24,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 501 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 11:24:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 287. [2024-10-24 11:24:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 255 states have (on average 1.411764705882353) internal successors, (360), 256 states have internal predecessors, (360), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 416 transitions. [2024-10-24 11:24:24,830 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 416 transitions. Word has length 101 [2024-10-24 11:24:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:24,831 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 416 transitions. [2024-10-24 11:24:24,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 416 transitions. [2024-10-24 11:24:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:24:24,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:24,832 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:24:24,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1174718783, now seen corresponding path program 1 times [2024-10-24 11:24:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674106213] [2024-10-24 11:24:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674106213] [2024-10-24 11:24:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674106213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:26,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:24:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793546204] [2024-10-24 11:24:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:26,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:24:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:24:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:24:26,432 INFO L87 Difference]: Start difference. First operand 287 states and 416 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:27,769 INFO L93 Difference]: Finished difference Result 698 states and 1010 transitions. [2024-10-24 11:24:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:24:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-10-24 11:24:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:27,772 INFO L225 Difference]: With dead ends: 698 [2024-10-24 11:24:27,772 INFO L226 Difference]: Without dead ends: 488 [2024-10-24 11:24:27,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:24:27,773 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 291 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:27,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 969 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:24:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-24 11:24:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 355. [2024-10-24 11:24:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 323 states have (on average 1.4303405572755419) internal successors, (462), 324 states have internal predecessors, (462), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2024-10-24 11:24:27,807 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 101 [2024-10-24 11:24:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:27,807 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2024-10-24 11:24:27,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2024-10-24 11:24:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:24:27,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:27,810 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:24:27,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1195485755, now seen corresponding path program 1 times [2024-10-24 11:24:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:27,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189555332] [2024-10-24 11:24:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:28,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189555332] [2024-10-24 11:24:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189555332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:24:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056533376] [2024-10-24 11:24:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:24:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:24:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:24:28,085 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:28,300 INFO L93 Difference]: Finished difference Result 680 states and 989 transitions. [2024-10-24 11:24:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:24:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:24:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:28,305 INFO L225 Difference]: With dead ends: 680 [2024-10-24 11:24:28,305 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 11:24:28,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:24:28,307 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:28,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 503 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 11:24:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 360. [2024-10-24 11:24:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 328 states have (on average 1.4329268292682926) internal successors, (470), 329 states have internal predecessors, (470), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 526 transitions. [2024-10-24 11:24:28,338 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 526 transitions. Word has length 103 [2024-10-24 11:24:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 526 transitions. [2024-10-24 11:24:28,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 526 transitions. [2024-10-24 11:24:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:24:28,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:28,342 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:28,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:24:28,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1588512765, now seen corresponding path program 1 times [2024-10-24 11:24:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:28,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103379696] [2024-10-24 11:24:28,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:29,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103379696] [2024-10-24 11:24:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103379696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:29,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:29,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:24:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134446488] [2024-10-24 11:24:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:29,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:24:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:24:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:29,929 INFO L87 Difference]: Start difference. First operand 360 states and 526 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:31,101 INFO L93 Difference]: Finished difference Result 761 states and 1112 transitions. [2024-10-24 11:24:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:24:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-24 11:24:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:31,105 INFO L225 Difference]: With dead ends: 761 [2024-10-24 11:24:31,105 INFO L226 Difference]: Without dead ends: 508 [2024-10-24 11:24:31,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:24:31,107 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 371 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:31,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 767 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:24:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-24 11:24:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 432. [2024-10-24 11:24:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 399 states have (on average 1.4411027568922306) internal successors, (575), 400 states have internal predecessors, (575), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 631 transitions. [2024-10-24 11:24:31,151 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 631 transitions. Word has length 103 [2024-10-24 11:24:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:31,151 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 631 transitions. [2024-10-24 11:24:31,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 631 transitions. [2024-10-24 11:24:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:24:31,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:31,153 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:31,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:24:31,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:31,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash 441327493, now seen corresponding path program 1 times [2024-10-24 11:24:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517274203] [2024-10-24 11:24:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517274203] [2024-10-24 11:24:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517274203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:31,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:31,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:24:31,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114972286] [2024-10-24 11:24:31,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:24:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:31,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:24:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:24:31,517 INFO L87 Difference]: Start difference. First operand 432 states and 631 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:31,698 INFO L93 Difference]: Finished difference Result 759 states and 1113 transitions. [2024-10-24 11:24:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:24:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-24 11:24:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:31,702 INFO L225 Difference]: With dead ends: 759 [2024-10-24 11:24:31,703 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 11:24:31,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:24:31,704 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:31,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 447 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:24:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 11:24:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2024-10-24 11:24:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 401 states have (on average 1.4389027431421446) internal successors, (577), 402 states have internal predecessors, (577), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 633 transitions. [2024-10-24 11:24:31,746 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 633 transitions. Word has length 103 [2024-10-24 11:24:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:31,746 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 633 transitions. [2024-10-24 11:24:31,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 633 transitions. [2024-10-24 11:24:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:24:31,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:31,748 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:31,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:24:31,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -376320957, now seen corresponding path program 1 times [2024-10-24 11:24:31,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859298396] [2024-10-24 11:24:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:32,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859298396] [2024-10-24 11:24:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859298396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:24:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704600412] [2024-10-24 11:24:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:24:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:24:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:24:33,057 INFO L87 Difference]: Start difference. First operand 434 states and 633 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:34,243 INFO L93 Difference]: Finished difference Result 923 states and 1348 transitions. [2024-10-24 11:24:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:24:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-24 11:24:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:34,246 INFO L225 Difference]: With dead ends: 923 [2024-10-24 11:24:34,246 INFO L226 Difference]: Without dead ends: 632 [2024-10-24 11:24:34,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:24:34,248 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 318 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:34,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1084 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:24:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-24 11:24:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 505. [2024-10-24 11:24:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 472 states have (on average 1.4427966101694916) internal successors, (681), 473 states have internal predecessors, (681), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 737 transitions. [2024-10-24 11:24:34,291 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 737 transitions. Word has length 103 [2024-10-24 11:24:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 737 transitions. [2024-10-24 11:24:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 737 transitions. [2024-10-24 11:24:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:24:34,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:34,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:34,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:24:34,293 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:34,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1807367483, now seen corresponding path program 1 times [2024-10-24 11:24:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278766193] [2024-10-24 11:24:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278766193] [2024-10-24 11:24:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278766193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:35,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:24:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528118224] [2024-10-24 11:24:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:35,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:24:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:24:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:24:35,584 INFO L87 Difference]: Start difference. First operand 505 states and 737 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:36,357 INFO L93 Difference]: Finished difference Result 945 states and 1379 transitions. [2024-10-24 11:24:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:24:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-24 11:24:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:36,361 INFO L225 Difference]: With dead ends: 945 [2024-10-24 11:24:36,361 INFO L226 Difference]: Without dead ends: 606 [2024-10-24 11:24:36,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:36,364 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 430 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:36,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 622 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:24:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-24 11:24:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 475. [2024-10-24 11:24:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 442 states have (on average 1.4298642533936652) internal successors, (632), 443 states have internal predecessors, (632), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 688 transitions. [2024-10-24 11:24:36,412 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 688 transitions. Word has length 103 [2024-10-24 11:24:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 688 transitions. [2024-10-24 11:24:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 688 transitions. [2024-10-24 11:24:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:24:36,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:36,414 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:36,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:24:36,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1091640218, now seen corresponding path program 1 times [2024-10-24 11:24:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770543952] [2024-10-24 11:24:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770543952] [2024-10-24 11:24:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770543952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:24:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742015480] [2024-10-24 11:24:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:24:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:24:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:24:37,007 INFO L87 Difference]: Start difference. First operand 475 states and 688 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:37,653 INFO L93 Difference]: Finished difference Result 921 states and 1329 transitions. [2024-10-24 11:24:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:24:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-24 11:24:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:37,657 INFO L225 Difference]: With dead ends: 921 [2024-10-24 11:24:37,657 INFO L226 Difference]: Without dead ends: 612 [2024-10-24 11:24:37,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:37,658 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 358 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:37,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 692 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:24:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-24 11:24:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 490. [2024-10-24 11:24:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 457 states have (on average 1.4223194748358863) internal successors, (650), 458 states have internal predecessors, (650), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 706 transitions. [2024-10-24 11:24:37,701 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 706 transitions. Word has length 104 [2024-10-24 11:24:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:37,702 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 706 transitions. [2024-10-24 11:24:37,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 706 transitions. [2024-10-24 11:24:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:24:37,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:37,704 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:37,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:24:37,705 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash 971963554, now seen corresponding path program 1 times [2024-10-24 11:24:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226098005] [2024-10-24 11:24:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:38,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:38,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226098005] [2024-10-24 11:24:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226098005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:38,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:38,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:24:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082301285] [2024-10-24 11:24:38,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:38,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:24:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:24:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:24:38,613 INFO L87 Difference]: Start difference. First operand 490 states and 706 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:39,711 INFO L93 Difference]: Finished difference Result 997 states and 1433 transitions. [2024-10-24 11:24:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:24:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-24 11:24:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:39,715 INFO L225 Difference]: With dead ends: 997 [2024-10-24 11:24:39,715 INFO L226 Difference]: Without dead ends: 679 [2024-10-24 11:24:39,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:24:39,717 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 535 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:39,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1097 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:24:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-24 11:24:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 492. [2024-10-24 11:24:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 459 states have (on average 1.4248366013071896) internal successors, (654), 460 states have internal predecessors, (654), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 710 transitions. [2024-10-24 11:24:39,764 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 710 transitions. Word has length 104 [2024-10-24 11:24:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:39,765 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 710 transitions. [2024-10-24 11:24:39,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:24:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 710 transitions. [2024-10-24 11:24:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:24:39,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:39,767 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:24:39,767 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 578936544, now seen corresponding path program 1 times [2024-10-24 11:24:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126164080] [2024-10-24 11:24:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126164080] [2024-10-24 11:24:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126164080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:41,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:24:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001951897] [2024-10-24 11:24:41,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:24:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:24:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:41,137 INFO L87 Difference]: Start difference. First operand 492 states and 710 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:42,356 INFO L93 Difference]: Finished difference Result 888 states and 1286 transitions. [2024-10-24 11:24:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:24:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-10-24 11:24:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:42,360 INFO L225 Difference]: With dead ends: 888 [2024-10-24 11:24:42,360 INFO L226 Difference]: Without dead ends: 568 [2024-10-24 11:24:42,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:24:42,362 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 514 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:42,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 834 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:24:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-24 11:24:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 464. [2024-10-24 11:24:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 431 states have (on average 1.419953596287703) internal successors, (612), 432 states have internal predecessors, (612), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 668 transitions. [2024-10-24 11:24:42,404 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 668 transitions. Word has length 104 [2024-10-24 11:24:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:42,404 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 668 transitions. [2024-10-24 11:24:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 11:24:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 668 transitions. [2024-10-24 11:24:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:24:42,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:42,405 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:42,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:24:42,406 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:42,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 598453846, now seen corresponding path program 1 times [2024-10-24 11:24:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595320016] [2024-10-24 11:24:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:43,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:43,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595320016] [2024-10-24 11:24:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595320016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:24:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11943191] [2024-10-24 11:24:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:43,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:24:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:43,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:24:43,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:24:43,968 INFO L87 Difference]: Start difference. First operand 464 states and 668 transitions. Second operand has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:45,137 INFO L93 Difference]: Finished difference Result 842 states and 1214 transitions. [2024-10-24 11:24:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:24:45,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-10-24 11:24:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:45,141 INFO L225 Difference]: With dead ends: 842 [2024-10-24 11:24:45,141 INFO L226 Difference]: Without dead ends: 534 [2024-10-24 11:24:45,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:24:45,142 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 390 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:45,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1110 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:24:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-24 11:24:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 460. [2024-10-24 11:24:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 427 states have (on average 1.414519906323185) internal successors, (604), 428 states have internal predecessors, (604), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 660 transitions. [2024-10-24 11:24:45,183 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 660 transitions. Word has length 104 [2024-10-24 11:24:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:45,183 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 660 transitions. [2024-10-24 11:24:45,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 660 transitions. [2024-10-24 11:24:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:24:45,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:45,185 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:45,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:24:45,185 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1784051193, now seen corresponding path program 1 times [2024-10-24 11:24:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456205753] [2024-10-24 11:24:45,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:24:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:24:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456205753] [2024-10-24 11:24:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456205753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:48,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-24 11:24:48,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836340736] [2024-10-24 11:24:48,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:48,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:24:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:48,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:24:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:24:48,725 INFO L87 Difference]: Start difference. First operand 460 states and 660 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:53,697 INFO L93 Difference]: Finished difference Result 961 states and 1374 transitions. [2024-10-24 11:24:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 11:24:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2024-10-24 11:24:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:53,700 INFO L225 Difference]: With dead ends: 961 [2024-10-24 11:24:53,700 INFO L226 Difference]: Without dead ends: 660 [2024-10-24 11:24:53,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 11:24:53,702 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 768 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:53,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 2032 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 11:24:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-10-24 11:24:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 462. [2024-10-24 11:24:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 429 states have (on average 1.4125874125874125) internal successors, (606), 430 states have internal predecessors, (606), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:24:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2024-10-24 11:24:53,755 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 105 [2024-10-24 11:24:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:53,755 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2024-10-24 11:24:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 11:24:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2024-10-24 11:24:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:24:53,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:53,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:53,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:24:53,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:53,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1177518149, now seen corresponding path program 1 times [2024-10-24 11:24:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74991681] [2024-10-24 11:24:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:24:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958215783] [2024-10-24 11:24:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:53,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:53,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:24:53,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:24:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:24:54,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:24:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:24:54,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:24:54,377 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:24:54,378 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:24:54,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:24:54,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 11:24:54,585 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:54,725 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:24:54,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:24:54 BoogieIcfgContainer [2024-10-24 11:24:54,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:24:54,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:24:54,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:24:54,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:24:54,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:19" (3/4) ... [2024-10-24 11:24:54,732 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:24:54,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:24:54,734 INFO L158 Benchmark]: Toolchain (without parser) took 36708.16ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 108.1MB in the beginning and 261.7MB in the end (delta: -153.5MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,734 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:24:54,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.32ms. Allocated memory is still 163.6MB. Free memory was 107.7MB in the beginning and 90.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.46ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 85.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,737 INFO L158 Benchmark]: Boogie Preprocessor took 110.12ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 80.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,737 INFO L158 Benchmark]: RCFGBuilder took 893.81ms. Allocated memory is still 163.6MB. Free memory was 80.9MB in the beginning and 105.7MB in the end (delta: -24.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,738 INFO L158 Benchmark]: TraceAbstraction took 35254.67ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 104.8MB in the beginning and 261.7MB in the end (delta: -156.8MB). Peak memory consumption was 279.0MB. Max. memory is 16.1GB. [2024-10-24 11:24:54,738 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 597.7MB. Free memory is still 261.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:24:54,739 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.16ms. Allocated memory is still 163.6MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.32ms. Allocated memory is still 163.6MB. Free memory was 107.7MB in the beginning and 90.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.46ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 85.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.12ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 80.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 893.81ms. Allocated memory is still 163.6MB. Free memory was 80.9MB in the beginning and 105.7MB in the end (delta: -24.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35254.67ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 104.8MB in the beginning and 261.7MB in the end (delta: -156.8MB). Peak memory consumption was 279.0MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 597.7MB. Free memory is still 261.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L35] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L36] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L37] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L38] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L39] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer = &(unsigned_short_int_Array_0[0][2]); [L40] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer = &(unsigned_short_int_Array_0[1][2]); [L41] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L42] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR unsigned_short_int_Array_0[0][0] [L94] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L95] EXPR unsigned_short_int_Array_0[1][2] [L95] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] 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_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L80] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L81] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L83] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L86] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L87] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L89] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L106] RET updateVariables() [L107] CALL step() [L46] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) = (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L60] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L62] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L69] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) [L98] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98-L99] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 21, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4575 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4572 mSDsluCounter, 13406 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10585 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8430 IncrementalHoareTripleChecker+Invalid, 8859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 2821 mSDtfsCounter, 8430 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 833 GetRequests, 627 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=14, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1992 ConstructedInterpolants, 0 QuantifiedInterpolants, 17610 SizeOfPredicates, 3 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 5280/5280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:24:54,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:24:56,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:24:56,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:24:56,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:24:56,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:24:56,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:24:56,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:24:56,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:24:56,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:24:56,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:24:56,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:24:56,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:24:56,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:24:56,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:24:56,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:24:56,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:24:56,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:24:56,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:24:56,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:24:56,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:24:56,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:24:56,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:24:56,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:24:56,986 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:24:56,986 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:24:56,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:24:56,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:24:56,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:24:56,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:24:56,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:24:56,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:24:56,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:24:56,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:24:56,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:24:56,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:56,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:24:56,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:24:56,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:24:56,991 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:24:56,991 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:24:56,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:24:56,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:24:56,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:24:56,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:24:56,993 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:24:56,993 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-10-24 11:24:57,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:24:57,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:24:57,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:24:57,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:24:57,363 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:24:57,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:24:58,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:24:59,117 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:24:59,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:24:59,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0cd9d2e/5ebb557cc1f04641b8d390ca39aac434/FLAGa9f976f45 [2024-10-24 11:24:59,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0cd9d2e/5ebb557cc1f04641b8d390ca39aac434 [2024-10-24 11:24:59,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:24:59,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:24:59,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:59,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:24:59,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:24:59,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315c3b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59, skipping insertion in model container [2024-10-24 11:24:59,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:24:59,706 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-10-24 11:24:59,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:59,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:24:59,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-10-24 11:24:59,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:59,860 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:24:59,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59 WrapperNode [2024-10-24 11:24:59,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:59,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:59,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:24:59,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:24:59,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,924 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-10-24 11:24:59,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:59,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:24:59,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:24:59,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:24:59,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,997 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-10-24 11:24:59,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:24:59,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:25:00,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:25:00,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:25:00,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:25:00,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (1/1) ... [2024-10-24 11:25:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:25:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:25:00,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:25:00,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:25:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:25:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:25:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:25:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:25:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:25:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:25:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:25:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:25:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:25:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:25:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:25:00,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:25:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:25:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:25:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:25:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:25:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:25:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:25:00,301 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:25:00,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:25:01,001 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-24 11:25:01,001 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:25:01,041 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:25:01,041 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:25:01,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:01 BoogieIcfgContainer [2024-10-24 11:25:01,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:25:01,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:25:01,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:25:01,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:25:01,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:24:59" (1/3) ... [2024-10-24 11:25:01,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed5a809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:01, skipping insertion in model container [2024-10-24 11:25:01,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:59" (2/3) ... [2024-10-24 11:25:01,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed5a809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:25:01, skipping insertion in model container [2024-10-24 11:25:01,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:25:01" (3/3) ... [2024-10-24 11:25:01,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-10-24 11:25:01,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:25:01,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:25:01,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:25:01,156 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2128b2eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:25:01,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:25:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:25:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:25:01,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:01,175 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:01,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:01,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash -106317321, now seen corresponding path program 1 times [2024-10-24 11:25:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416066417] [2024-10-24 11:25:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:01,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:01,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:01,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:01,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:25:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:01,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:25:01,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-24 11:25:01,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:01,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416066417] [2024-10-24 11:25:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416066417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:25:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965422156] [2024-10-24 11:25:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:25:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:25:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:25:01,544 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:25:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:01,598 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2024-10-24 11:25:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:25:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-24 11:25:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:01,610 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:25:01,611 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:25:01,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:25:01,620 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:01,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:25:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:25:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:25:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:25:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-24 11:25:01,672 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 95 [2024-10-24 11:25:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-24 11:25:01,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:25:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-24 11:25:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:25:01,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:01,679 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:01,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:25:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:01,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1215722805, now seen corresponding path program 1 times [2024-10-24 11:25:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923508609] [2024-10-24 11:25:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:01,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:01,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:25:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:25:02,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 11:25:02,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:02,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923508609] [2024-10-24 11:25:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923508609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:02,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:02,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:25:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370654614] [2024-10-24 11:25:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:25:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:25:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:25:02,218 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:25:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:02,291 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-10-24 11:25:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:25:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-24 11:25:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:02,295 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:25:02,295 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:25:02,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:25:02,297 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:02,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:25:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:25:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:25:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:25:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-24 11:25:02,307 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 95 [2024-10-24 11:25:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:02,308 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-24 11:25:02,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:25:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-24 11:25:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:25:02,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:02,312 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:02,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:25:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:02,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -157884727, now seen corresponding path program 1 times [2024-10-24 11:25:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163423115] [2024-10-24 11:25:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:02,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:02,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:02,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:02,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:25:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:02,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:25:02,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:02,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:25:02,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-10-24 11:25:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:25:03,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:03,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163423115] [2024-10-24 11:25:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163423115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:25:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714568415] [2024-10-24 11:25:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:25:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:25:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:25:03,366 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:03,750 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2024-10-24 11:25:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:25:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-24 11:25:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:03,752 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:25:03,752 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 11:25:03,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:03,756 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 117 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:03,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 330 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:25:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 11:25:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2024-10-24 11:25:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:25:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-24 11:25:03,784 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 95 [2024-10-24 11:25:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:03,785 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-24 11:25:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-24 11:25:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:25:03,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:03,789 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:03,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:25:03,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:03,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:03,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1966242254, now seen corresponding path program 1 times [2024-10-24 11:25:03,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:03,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568987579] [2024-10-24 11:25:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:03,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:03,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:25:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:25:04,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:25:04,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:04,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568987579] [2024-10-24 11:25:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568987579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:25:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312348538] [2024-10-24 11:25:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:04,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:25:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:25:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:25:04,254 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:04,291 INFO L93 Difference]: Finished difference Result 256 states and 380 transitions. [2024-10-24 11:25:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:25:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-24 11:25:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:04,293 INFO L225 Difference]: With dead ends: 256 [2024-10-24 11:25:04,293 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 11:25:04,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:25:04,295 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:04,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:25:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 11:25:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-24 11:25:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:25:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-10-24 11:25:04,317 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 101 [2024-10-24 11:25:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:04,318 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-10-24 11:25:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-10-24 11:25:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:25:04,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:04,319 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:04,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:25:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:04,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:04,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1307656688, now seen corresponding path program 1 times [2024-10-24 11:25:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269785793] [2024-10-24 11:25:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:04,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:04,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:04,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:04,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:25:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:04,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:25:04,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:04,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:25:04,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2024-10-24 11:25:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:25:04,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:25:04,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269785793] [2024-10-24 11:25:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269785793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:25:04,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:25:04,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:25:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582914360] [2024-10-24 11:25:04,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:25:04,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:25:04,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:25:04,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:25:04,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:25:04,884 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:25:05,349 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2024-10-24 11:25:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:25:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-24 11:25:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:25:05,352 INFO L225 Difference]: With dead ends: 309 [2024-10-24 11:25:05,352 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 11:25:05,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:25:05,354 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 76 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:25:05,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 477 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:25:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 11:25:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-10-24 11:25:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 181 states have (on average 1.408839779005525) internal successors, (255), 182 states have internal predecessors, (255), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:25:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 311 transitions. [2024-10-24 11:25:05,369 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 311 transitions. Word has length 101 [2024-10-24 11:25:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:25:05,370 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 311 transitions. [2024-10-24 11:25:05,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:25:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 311 transitions. [2024-10-24 11:25:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:25:05,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:25:05,376 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:25:05,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:25:05,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:05,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:25:05,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:25:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash 914629678, now seen corresponding path program 1 times [2024-10-24 11:25:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:25:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925026454] [2024-10-24 11:25:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:05,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:25:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:25:05,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:25:05,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:25:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:05,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:25:05,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:07,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:25:08,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-10-24 11:25:08,347 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-10-24 11:25:08,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2024-10-24 11:25:08,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:25:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-10-24 11:25:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 11:25:08,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:25:13,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:25:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925026454] [2024-10-24 11:25:13,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925026454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:25:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [463142920] [2024-10-24 11:25:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:25:13,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:25:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:25:13,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:25:13,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-24 11:25:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:25:13,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:25:13,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:25:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:25:17,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-10-24 11:25:17,543 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2024-10-24 11:25:17,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 46 [2024-10-24 11:25:18,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-10-24 11:25:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 11:25:18,178 INFO L311 TraceCheckSpWp]: Computing backward predicates...