./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.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 b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:41:20,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:41:20,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:41:20,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:41:20,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:41:20,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:41:20,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:41:20,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:41:20,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:41:20,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:41:20,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:41:20,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:41:20,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:41:20,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:41:20,741 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:41:20,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:41:20,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:41:20,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:41:20,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:41:20,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:41:20,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:41:20,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:41:20,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:41:20,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:41:20,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:41:20,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:41:20,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:41:20,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:41:20,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:41:20,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:41:20,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:41:20,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:41:20,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:41:20,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:41:20,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:41:20,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:41:20,751 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 -> b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 [2024-11-09 01:41:20,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:41:20,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:41:20,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:41:20,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:41:20,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:41:20,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:22,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:41:22,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:41:22,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:22,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7b02f5e2/1878f38907f14858ba0ff1291d0467cf/FLAG8efcfb081 [2024-11-09 01:41:22,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7b02f5e2/1878f38907f14858ba0ff1291d0467cf [2024-11-09 01:41:22,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:41:22,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:41:22,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:41:22,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:41:22,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:41:22,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a376d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22, skipping insertion in model container [2024-11-09 01:41:22,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:41:22,534 WARN L250 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-39.i[917,930] [2024-11-09 01:41:22,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:41:22,614 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:41:22,623 WARN L250 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-39.i[917,930] [2024-11-09 01:41:22,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:41:22,672 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:41:22,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22 WrapperNode [2024-11-09 01:41:22,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:41:22,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:41:22,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:41:22,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:41:22,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,723 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 616 [2024-11-09 01:41:22,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:41:22,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:41:22,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:41:22,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:41:22,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,753 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2024-11-09 01:41:22,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:41:22,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:41:22,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:41:22,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:41:22,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (1/1) ... [2024-11-09 01:41:22,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:41:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:41:22,821 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-11-09 01:41:22,824 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-11-09 01:41:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:41:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:41:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:41:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:41:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:41:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:41:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:41:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:41:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:41:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:41:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:41:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:41:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:41:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:41:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:41:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:41:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:41:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:41:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:41:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:41:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:41:23,030 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:41:23,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:41:23,479 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-09 01:41:23,479 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:41:23,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:41:23,492 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:41:23,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:23 BoogieIcfgContainer [2024-11-09 01:41:23,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:41:23,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:41:23,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:41:23,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:41:23,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:41:22" (1/3) ... [2024-11-09 01:41:23,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efa6fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:23, skipping insertion in model container [2024-11-09 01:41:23,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:22" (2/3) ... [2024-11-09 01:41:23,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efa6fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:23, skipping insertion in model container [2024-11-09 01:41:23,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:23" (3/3) ... [2024-11-09 01:41:23,498 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:23,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:41:23,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:41:23,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:41:23,562 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;@5674e01a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:41:23,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:41:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:41:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:41:23,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:23,578 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:23,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1938211499, now seen corresponding path program 1 times [2024-11-09 01:41:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076579361] [2024-11-09 01:41:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076579361] [2024-11-09 01:41:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076579361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:23,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:41:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570704470] [2024-11-09 01:41:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:23,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:41:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:41:24,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:41:24,013 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:24,069 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-09 01:41:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:41:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 01:41:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:24,077 INFO L225 Difference]: With dead ends: 233 [2024-11-09 01:41:24,077 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 01:41:24,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:41:24,082 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:24,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:41:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 01:41:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 01:41:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:41:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-09 01:41:24,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-09 01:41:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:24,119 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-09 01:41:24,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-09 01:41:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:41:24,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:24,122 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:41:24,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -321601841, now seen corresponding path program 1 times [2024-11-09 01:41:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096006083] [2024-11-09 01:41:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096006083] [2024-11-09 01:41:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096006083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:41:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946110878] [2024-11-09 01:41:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:41:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:41:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:41:27,026 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:29,273 INFO L93 Difference]: Finished difference Result 382 states and 559 transitions. [2024-11-09 01:41:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:41:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-09 01:41:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:29,276 INFO L225 Difference]: With dead ends: 382 [2024-11-09 01:41:29,277 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 01:41:29,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:41:29,278 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 429 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:29,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1935 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:41:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 01:41:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2024-11-09 01:41:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.4330357142857142) internal successors, (321), 226 states have internal predecessors, (321), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 369 transitions. [2024-11-09 01:41:29,314 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 369 transitions. Word has length 128 [2024-11-09 01:41:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:29,315 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 369 transitions. [2024-11-09 01:41:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 369 transitions. [2024-11-09 01:41:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:41:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:29,319 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:29,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:41:29,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 358456529, now seen corresponding path program 1 times [2024-11-09 01:41:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420989842] [2024-11-09 01:41:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420989842] [2024-11-09 01:41:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420989842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:41:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822034956] [2024-11-09 01:41:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:41:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:41:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:41:29,855 INFO L87 Difference]: Start difference. First operand 252 states and 369 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:30,404 INFO L93 Difference]: Finished difference Result 587 states and 861 transitions. [2024-11-09 01:41:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:41:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 01:41:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:30,408 INFO L225 Difference]: With dead ends: 587 [2024-11-09 01:41:30,411 INFO L226 Difference]: Without dead ends: 338 [2024-11-09 01:41:30,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:41:30,413 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 436 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:30,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 574 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:41:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-09 01:41:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 274. [2024-11-09 01:41:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 246 states have (on average 1.434959349593496) internal successors, (353), 248 states have internal predecessors, (353), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2024-11-09 01:41:30,443 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 128 [2024-11-09 01:41:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:30,444 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2024-11-09 01:41:30,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2024-11-09 01:41:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:41:30,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:30,450 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:30,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:41:30,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:30,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1909949743, now seen corresponding path program 1 times [2024-11-09 01:41:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313454969] [2024-11-09 01:41:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313454969] [2024-11-09 01:41:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313454969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:30,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:30,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:41:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098802902] [2024-11-09 01:41:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:30,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:41:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:30,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:41:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:41:30,910 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:31,370 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2024-11-09 01:41:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:41:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 01:41:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:31,372 INFO L225 Difference]: With dead ends: 553 [2024-11-09 01:41:31,372 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 01:41:31,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:41:31,374 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 510 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:31,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 691 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:41:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 01:41:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 216. [2024-11-09 01:41:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.4196891191709844) internal successors, (274), 194 states have internal predecessors, (274), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 312 transitions. [2024-11-09 01:41:31,401 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 312 transitions. Word has length 128 [2024-11-09 01:41:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 312 transitions. [2024-11-09 01:41:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 312 transitions. [2024-11-09 01:41:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:41:31,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:31,405 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:31,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:41:31,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:31,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1229891373, now seen corresponding path program 1 times [2024-11-09 01:41:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573602868] [2024-11-09 01:41:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573602868] [2024-11-09 01:41:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573602868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:33,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:33,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 01:41:33,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066949631] [2024-11-09 01:41:33,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:33,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 01:41:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 01:41:33,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:41:33,035 INFO L87 Difference]: Start difference. First operand 216 states and 312 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:34,608 INFO L93 Difference]: Finished difference Result 513 states and 743 transitions. [2024-11-09 01:41:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:41:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2024-11-09 01:41:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:34,610 INFO L225 Difference]: With dead ends: 513 [2024-11-09 01:41:34,610 INFO L226 Difference]: Without dead ends: 300 [2024-11-09 01:41:34,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:41:34,612 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 493 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:34,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 999 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:41:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-09 01:41:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 235. [2024-11-09 01:41:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 212 states have (on average 1.429245283018868) internal successors, (303), 213 states have internal predecessors, (303), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 341 transitions. [2024-11-09 01:41:34,639 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 341 transitions. Word has length 128 [2024-11-09 01:41:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:34,639 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 341 transitions. [2024-11-09 01:41:34,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 341 transitions. [2024-11-09 01:41:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:41:34,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:34,641 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:34,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:41:34,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:34,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2071281815, now seen corresponding path program 1 times [2024-11-09 01:41:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680449370] [2024-11-09 01:41:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680449370] [2024-11-09 01:41:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680449370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:36,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:41:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256381008] [2024-11-09 01:41:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:36,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:41:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:41:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:41:36,981 INFO L87 Difference]: Start difference. First operand 235 states and 341 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:39,480 INFO L93 Difference]: Finished difference Result 686 states and 996 transitions. [2024-11-09 01:41:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:41:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:41:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:39,482 INFO L225 Difference]: With dead ends: 686 [2024-11-09 01:41:39,482 INFO L226 Difference]: Without dead ends: 454 [2024-11-09 01:41:39,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:41:39,485 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 488 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:39,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1513 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 01:41:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-09 01:41:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 251. [2024-11-09 01:41:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 228 states have (on average 1.4342105263157894) internal successors, (327), 229 states have internal predecessors, (327), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 365 transitions. [2024-11-09 01:41:39,514 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 365 transitions. Word has length 129 [2024-11-09 01:41:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:39,515 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 365 transitions. [2024-11-09 01:41:39,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 365 transitions. [2024-11-09 01:41:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:41:39,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:39,516 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:41:39,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:39,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 316239307, now seen corresponding path program 1 times [2024-11-09 01:41:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350660261] [2024-11-09 01:41:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350660261] [2024-11-09 01:41:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350660261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:41:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805989388] [2024-11-09 01:41:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:41:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:41:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:41:40,615 INFO L87 Difference]: Start difference. First operand 251 states and 365 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:41,604 INFO L93 Difference]: Finished difference Result 566 states and 822 transitions. [2024-11-09 01:41:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:41:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:41:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:41,606 INFO L225 Difference]: With dead ends: 566 [2024-11-09 01:41:41,606 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 01:41:41,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:41:41,607 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 330 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:41,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1042 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:41:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 01:41:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 231. [2024-11-09 01:41:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 208 states have (on average 1.4278846153846154) internal successors, (297), 209 states have internal predecessors, (297), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2024-11-09 01:41:41,632 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 129 [2024-11-09 01:41:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:41,633 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2024-11-09 01:41:41,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:41:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2024-11-09 01:41:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 01:41:41,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:41,634 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:41,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:41:41,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -541234758, now seen corresponding path program 1 times [2024-11-09 01:41:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003654355] [2024-11-09 01:41:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003654355] [2024-11-09 01:41:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003654355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:41:41,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745773600] [2024-11-09 01:41:41,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:41,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:41:41,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:41:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:41:41,898 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:42,229 INFO L93 Difference]: Finished difference Result 539 states and 781 transitions. [2024-11-09 01:41:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:41:42,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-11-09 01:41:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:42,231 INFO L225 Difference]: With dead ends: 539 [2024-11-09 01:41:42,231 INFO L226 Difference]: Without dead ends: 311 [2024-11-09 01:41:42,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:41:42,232 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 498 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:42,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 774 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:41:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-09 01:41:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 245. [2024-11-09 01:41:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 222 states have (on average 1.4324324324324325) internal successors, (318), 223 states have internal predecessors, (318), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 356 transitions. [2024-11-09 01:41:42,257 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 356 transitions. Word has length 130 [2024-11-09 01:41:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:42,259 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 356 transitions. [2024-11-09 01:41:42,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 356 transitions. [2024-11-09 01:41:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:41:42,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:42,261 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:41:42,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:42,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 420940497, now seen corresponding path program 1 times [2024-11-09 01:41:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234973998] [2024-11-09 01:41:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:43,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234973998] [2024-11-09 01:41:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234973998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:41:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436119324] [2024-11-09 01:41:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:41:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:41:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:41:43,353 INFO L87 Difference]: Start difference. First operand 245 states and 356 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:44,384 INFO L93 Difference]: Finished difference Result 611 states and 886 transitions. [2024-11-09 01:41:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:41:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2024-11-09 01:41:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:44,387 INFO L225 Difference]: With dead ends: 611 [2024-11-09 01:41:44,387 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 01:41:44,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:41:44,389 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 475 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:44,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1192 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:41:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 01:41:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 243. [2024-11-09 01:41:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 220 states have (on average 1.4318181818181819) internal successors, (315), 221 states have internal predecessors, (315), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 01:41:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 353 transitions. [2024-11-09 01:41:44,422 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 353 transitions. Word has length 131 [2024-11-09 01:41:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 353 transitions. [2024-11-09 01:41:44,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 353 transitions. [2024-11-09 01:41:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 01:41:44,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:44,424 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:44,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:41:44,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -842538372, now seen corresponding path program 1 times [2024-11-09 01:41:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:44,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491769391] [2024-11-09 01:41:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491769391] [2024-11-09 01:41:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491769391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:44,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:44,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:41:44,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176276109] [2024-11-09 01:41:44,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:44,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:41:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:41:44,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:41:44,557 INFO L87 Difference]: Start difference. First operand 243 states and 353 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:44,773 INFO L93 Difference]: Finished difference Result 494 states and 714 transitions. [2024-11-09 01:41:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:41:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-09 01:41:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:44,775 INFO L225 Difference]: With dead ends: 494 [2024-11-09 01:41:44,775 INFO L226 Difference]: Without dead ends: 254 [2024-11-09 01:41:44,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-09 01:41:44,776 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 117 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:44,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 615 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:41:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-09 01:41:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2024-11-09 01:41:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 226 states have internal predecessors, (319), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:41:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 361 transitions. [2024-11-09 01:41:44,812 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 361 transitions. Word has length 133 [2024-11-09 01:41:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 361 transitions. [2024-11-09 01:41:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 361 transitions. [2024-11-09 01:41:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:41:44,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:44,813 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:44,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:41:44,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:44,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash -665800542, now seen corresponding path program 1 times [2024-11-09 01:41:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293329121] [2024-11-09 01:41:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293329121] [2024-11-09 01:41:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293329121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:41:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264057492] [2024-11-09 01:41:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:41:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:41:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:41:44,935 INFO L87 Difference]: Start difference. First operand 251 states and 361 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:45,105 INFO L93 Difference]: Finished difference Result 495 states and 711 transitions. [2024-11-09 01:41:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:41:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-09 01:41:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:45,107 INFO L225 Difference]: With dead ends: 495 [2024-11-09 01:41:45,107 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 01:41:45,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-09 01:41:45,108 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 106 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:45,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 578 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:41:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 01:41:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-11-09 01:41:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 218 states have (on average 1.4128440366972477) internal successors, (308), 219 states have internal predecessors, (308), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 01:41:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 350 transitions. [2024-11-09 01:41:45,143 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 350 transitions. Word has length 134 [2024-11-09 01:41:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:45,144 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 350 transitions. [2024-11-09 01:41:45,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 350 transitions. [2024-11-09 01:41:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 01:41:45,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:45,145 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:45,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:41:45,145 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:45,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1251066523, now seen corresponding path program 1 times [2024-11-09 01:41:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:45,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801708874] [2024-11-09 01:41:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801708874] [2024-11-09 01:41:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801708874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:41:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053098421] [2024-11-09 01:41:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:45,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:41:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:45,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:41:45,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:41:45,331 INFO L87 Difference]: Start difference. First operand 244 states and 350 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:45,536 INFO L93 Difference]: Finished difference Result 378 states and 531 transitions. [2024-11-09 01:41:45,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:41:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-09 01:41:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:45,538 INFO L225 Difference]: With dead ends: 378 [2024-11-09 01:41:45,538 INFO L226 Difference]: Without dead ends: 376 [2024-11-09 01:41:45,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:41:45,539 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 82 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:45,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 989 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:41:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-09 01:41:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 328. [2024-11-09 01:41:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 298 states have (on average 1.3859060402684564) internal successors, (413), 300 states have internal predecessors, (413), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 461 transitions. [2024-11-09 01:41:45,588 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 461 transitions. Word has length 134 [2024-11-09 01:41:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:45,589 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 461 transitions. [2024-11-09 01:41:45,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 461 transitions. [2024-11-09 01:41:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 01:41:45,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:45,590 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:45,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:41:45,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:45,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1807259723, now seen corresponding path program 1 times [2024-11-09 01:41:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:45,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397071665] [2024-11-09 01:41:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397071665] [2024-11-09 01:41:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397071665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 01:41:46,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561231547] [2024-11-09 01:41:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:41:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:41:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:41:46,454 INFO L87 Difference]: Start difference. First operand 328 states and 461 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:47,465 INFO L93 Difference]: Finished difference Result 773 states and 1089 transitions. [2024-11-09 01:41:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:41:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2024-11-09 01:41:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:47,467 INFO L225 Difference]: With dead ends: 773 [2024-11-09 01:41:47,467 INFO L226 Difference]: Without dead ends: 448 [2024-11-09 01:41:47,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:41:47,468 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 969 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:47,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 952 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:41:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-09 01:41:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 369. [2024-11-09 01:41:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 339 states have (on average 1.3952802359882006) internal successors, (473), 341 states have internal predecessors, (473), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 521 transitions. [2024-11-09 01:41:47,512 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 521 transitions. Word has length 135 [2024-11-09 01:41:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:47,512 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 521 transitions. [2024-11-09 01:41:47,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 521 transitions. [2024-11-09 01:41:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:41:47,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:47,513 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:41:47,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:47,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1348992656, now seen corresponding path program 1 times [2024-11-09 01:41:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:47,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841192435] [2024-11-09 01:41:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841192435] [2024-11-09 01:41:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841192435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 01:41:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953111924] [2024-11-09 01:41:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:48,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 01:41:48,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:48,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 01:41:48,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:41:48,371 INFO L87 Difference]: Start difference. First operand 369 states and 521 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:49,171 INFO L93 Difference]: Finished difference Result 804 states and 1129 transitions. [2024-11-09 01:41:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:41:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 136 [2024-11-09 01:41:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:49,174 INFO L225 Difference]: With dead ends: 804 [2024-11-09 01:41:49,174 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 01:41:49,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:41:49,175 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 842 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:49,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 682 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:41:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 01:41:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2024-11-09 01:41:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 352 states have (on average 1.3835227272727273) internal successors, (487), 354 states have internal predecessors, (487), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 535 transitions. [2024-11-09 01:41:49,222 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 535 transitions. Word has length 136 [2024-11-09 01:41:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:49,222 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 535 transitions. [2024-11-09 01:41:49,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:41:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 535 transitions. [2024-11-09 01:41:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:41:49,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:49,223 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:41:49,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:49,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1302307900, now seen corresponding path program 1 times [2024-11-09 01:41:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792928872] [2024-11-09 01:41:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:49,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792928872] [2024-11-09 01:41:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792928872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:41:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658129283] [2024-11-09 01:41:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:41:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:41:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:41:49,326 INFO L87 Difference]: Start difference. First operand 382 states and 535 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:49,540 INFO L93 Difference]: Finished difference Result 978 states and 1374 transitions. [2024-11-09 01:41:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:41:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 01:41:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:49,542 INFO L225 Difference]: With dead ends: 978 [2024-11-09 01:41:49,543 INFO L226 Difference]: Without dead ends: 599 [2024-11-09 01:41:49,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-09 01:41:49,548 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 107 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:49,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 442 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:41:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-09 01:41:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 440. [2024-11-09 01:41:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 410 states have (on average 1.3829268292682926) internal successors, (567), 412 states have internal predecessors, (567), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 615 transitions. [2024-11-09 01:41:49,594 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 615 transitions. Word has length 136 [2024-11-09 01:41:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 615 transitions. [2024-11-09 01:41:49,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 615 transitions. [2024-11-09 01:41:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:41:49,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:49,596 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:41:49,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1343544007, now seen corresponding path program 1 times [2024-11-09 01:41:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179621442] [2024-11-09 01:41:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:49,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179621442] [2024-11-09 01:41:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179621442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:41:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299396976] [2024-11-09 01:41:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:41:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:49,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:41:49,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:41:49,698 INFO L87 Difference]: Start difference. First operand 440 states and 615 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:49,918 INFO L93 Difference]: Finished difference Result 1036 states and 1450 transitions. [2024-11-09 01:41:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:41:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 01:41:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:49,921 INFO L225 Difference]: With dead ends: 1036 [2024-11-09 01:41:49,921 INFO L226 Difference]: Without dead ends: 599 [2024-11-09 01:41:49,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-09 01:41:49,922 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 106 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:49,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 731 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:41:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-09 01:41:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 440. [2024-11-09 01:41:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 410 states have (on average 1.3731707317073172) internal successors, (563), 412 states have internal predecessors, (563), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 611 transitions. [2024-11-09 01:41:49,967 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 611 transitions. Word has length 136 [2024-11-09 01:41:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:49,967 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 611 transitions. [2024-11-09 01:41:49,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2024-11-09 01:41:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:41:49,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:49,969 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:49,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:41:49,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 55100714, now seen corresponding path program 1 times [2024-11-09 01:41:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416943571] [2024-11-09 01:41:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 01:41:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:41:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 01:41:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:41:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:41:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:41:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:41:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:41:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:41:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:41:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 01:41:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 01:41:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 01:41:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 01:41:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:41:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:41:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:41:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:41:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416943571] [2024-11-09 01:41:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416943571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:41:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131581921] [2024-11-09 01:41:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:41:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:41:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:41:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:41:50,185 INFO L87 Difference]: Start difference. First operand 440 states and 611 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:50,390 INFO L93 Difference]: Finished difference Result 604 states and 823 transitions. [2024-11-09 01:41:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:41:50,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 01:41:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:50,392 INFO L225 Difference]: With dead ends: 604 [2024-11-09 01:41:50,392 INFO L226 Difference]: Without dead ends: 602 [2024-11-09 01:41:50,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:41:50,393 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 82 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:50,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1291 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:41:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-09 01:41:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 504. [2024-11-09 01:41:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 474 states have (on average 1.3438818565400843) internal successors, (637), 476 states have internal predecessors, (637), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:41:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 685 transitions. [2024-11-09 01:41:50,437 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 685 transitions. Word has length 137 [2024-11-09 01:41:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:50,437 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 685 transitions. [2024-11-09 01:41:50,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:41:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 685 transitions. [2024-11-09 01:41:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:41:50,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:50,438 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:50,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:41:50,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:50,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1502374088, now seen corresponding path program 1 times [2024-11-09 01:41:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:41:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330733594] [2024-11-09 01:41:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:41:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:41:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498482922] [2024-11-09 01:41:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:41:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:41:50,483 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-11-09 01:41:50,484 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-11-09 01:41:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:41:50,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:41:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:41:51,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:41:51,074 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:41:51,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:41:51,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:41:51,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 01:41:51,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:51,401 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:41:51,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:41:51 BoogieIcfgContainer [2024-11-09 01:41:51,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:41:51,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:41:51,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:41:51,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:41:51,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:23" (3/4) ... [2024-11-09 01:41:51,406 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:41:51,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:41:51,408 INFO L158 Benchmark]: Toolchain (without parser) took 29033.29ms. Allocated memory was 163.6MB in the beginning and 616.6MB in the end (delta: 453.0MB). Free memory was 90.0MB in the beginning and 259.0MB in the end (delta: -169.0MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,408 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:41:51,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.03ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 72.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 163.6MB. Free memory was 72.7MB in the beginning and 68.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,409 INFO L158 Benchmark]: Boogie Preprocessor took 66.24ms. Allocated memory is still 163.6MB. Free memory was 68.6MB in the beginning and 63.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,409 INFO L158 Benchmark]: RCFGBuilder took 701.68ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 63.7MB in the beginning and 171.1MB in the end (delta: -107.4MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,409 INFO L158 Benchmark]: TraceAbstraction took 27909.70ms. Allocated memory was 237.0MB in the beginning and 616.6MB in the end (delta: 379.6MB). Free memory was 171.1MB in the beginning and 260.1MB in the end (delta: -88.9MB). Peak memory consumption was 291.7MB. Max. memory is 16.1GB. [2024-11-09 01:41:51,409 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 616.6MB. Free memory is still 259.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:41:51,410 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.10ms. Allocated memory is still 163.6MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.03ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 72.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 163.6MB. Free memory was 72.7MB in the beginning and 68.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.24ms. Allocated memory is still 163.6MB. Free memory was 68.6MB in the beginning and 63.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 701.68ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 63.7MB in the beginning and 171.1MB in the end (delta: -107.4MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27909.70ms. Allocated memory was 237.0MB in the beginning and 616.6MB in the end (delta: 379.6MB). Free memory was 171.1MB in the beginning and 260.1MB in the end (delta: -88.9MB). Peak memory consumption was 291.7MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 616.6MB. Free memory is still 259.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of shiftLeft at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L31] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L32] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L33] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer = &(signed_long_int_Array_0[2]); [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L39] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer = &(signed_short_int_Array_0[2]); [L40] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer = &(signed_short_int_Array_0[3]); [L41] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer = &(signed_short_int_Array_0[4]); [L42-L44] unsigned char unsigned_char_Array_0[1] = { 64 }; [L42-L44] unsigned char unsigned_char_Array_0[1] = { 64 }; [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=0, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L72] float_Array_0[0] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L76] float_Array_0[2] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[2] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L77] EXPR float_Array_0[2] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L78] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L79] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L81] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L82] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L82] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L82] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L84] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L87] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L90] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L109] RET updateVariables() [L110] CALL step() [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L49] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) = ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L50] COND FALSE !((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) [L57] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L57] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) [L59] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L59] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L59] signed long int stepLocal_1 = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))); [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L60] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L60] signed long int stepLocal_0 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))); [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L61] COND TRUE stepLocal_1 != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L62] COND FALSE !(((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < stepLocal_0) [L65] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L65] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) [L101] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) [L101] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) [L101] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L101] EXPR (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101-L102] return (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6071 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6070 mSDsluCounter, 15170 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12268 mSDsCounter, 434 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11965 IncrementalHoareTripleChecker+Invalid, 12399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 434 mSolverCounterUnsat, 2902 mSDtfsCounter, 11965 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=17, InterpolantAutomatonStates: 142, 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, 17 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2514 NumberOfCodeBlocks, 2514 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 20305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 8160/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:41:51,481 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.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 b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:41:53,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:41:53,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:41:53,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:41:53,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:41:53,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:41:53,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:41:53,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:41:53,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:41:53,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:41:53,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:41:53,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:41:53,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:41:53,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:41:53,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:41:53,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:41:53,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:41:53,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:41:53,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:41:53,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:41:53,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:41:53,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:41:53,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:41:53,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:41:53,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:41:53,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:41:53,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:41:53,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:41:53,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:41:53,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:41:53,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:41:53,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:41:53,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:41:53,406 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:41:53,406 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:41:53,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:41:53,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:41:53,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:41:53,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:41:53,408 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 -> b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 [2024-11-09 01:41:53,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:41:53,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:41:53,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:41:53,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:41:53,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:41:53,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:54,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:41:55,750 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:41:55,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:55,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c2eb6dc/94d14766b59147f9b4f534b06c9785a1/FLAGb67d3edf5 [2024-11-09 01:41:56,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c2eb6dc/94d14766b59147f9b4f534b06c9785a1 [2024-11-09 01:41:56,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:41:56,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:41:56,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:41:56,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:41:56,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:41:56,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a160f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56, skipping insertion in model container [2024-11-09 01:41:56,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:41:56,359 WARN L250 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-39.i[917,930] [2024-11-09 01:41:56,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:41:56,451 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:41:56,461 WARN L250 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-39.i[917,930] [2024-11-09 01:41:56,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:41:56,535 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:41:56,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56 WrapperNode [2024-11-09 01:41:56,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:41:56,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:41:56,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:41:56,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:41:56,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,601 INFO L138 Inliner]: procedures = 36, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 598 [2024-11-09 01:41:56,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:41:56,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:41:56,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:41:56,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:41:56,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,640 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2024-11-09 01:41:56,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:41:56,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:41:56,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:41:56,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:41:56,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (1/1) ... [2024-11-09 01:41:56,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:41:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:41:56,716 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-11-09 01:41:56,724 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-11-09 01:41:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:41:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:41:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:41:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:41:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:41:56,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:41:56,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:41:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:41:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:41:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 01:41:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:41:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:41:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:41:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:41:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:41:56,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:41:56,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:41:56,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:41:57,937 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-09 01:41:57,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:41:57,953 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:41:57,954 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:41:57,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:57 BoogieIcfgContainer [2024-11-09 01:41:57,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:41:57,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:41:57,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:41:57,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:41:57,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:41:56" (1/3) ... [2024-11-09 01:41:57,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d99720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:57, skipping insertion in model container [2024-11-09 01:41:57,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:41:56" (2/3) ... [2024-11-09 01:41:57,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d99720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:41:57, skipping insertion in model container [2024-11-09 01:41:57,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:41:57" (3/3) ... [2024-11-09 01:41:57,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-39.i [2024-11-09 01:41:57,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:41:57,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:41:58,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:41:58,032 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;@1d0ecdc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:41:58,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:41:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:41:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:41:58,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:58,047 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:58,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:58,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:58,054 INFO L85 PathProgramCache]: Analyzing trace with hash -607755742, now seen corresponding path program 1 times [2024-11-09 01:41:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:41:58,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630665337] [2024-11-09 01:41:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:58,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:41:58,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:41:58,070 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-11-09 01:41:58,071 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-11-09 01:41:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:58,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:41:58,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:41:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-09 01:41:58,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:41:58,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:41:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630665337] [2024-11-09 01:41:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630665337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:41:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:41:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:41:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990637721] [2024-11-09 01:41:58,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:41:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:41:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:41:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:41:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:41:58,448 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:41:58,474 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-11-09 01:41:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:41:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-11-09 01:41:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:41:58,483 INFO L225 Difference]: With dead ends: 221 [2024-11-09 01:41:58,483 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 01:41:58,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:41:58,490 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:41:58,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:41:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 01:41:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 01:41:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:41:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-09 01:41:58,523 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2024-11-09 01:41:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:41:58,523 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-09 01:41:58,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:41:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-09 01:41:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:41:58,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:41:58,525 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:41:58,533 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-11-09 01:41:58,726 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-11-09 01:41:58,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:41:58,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:41:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1007872186, now seen corresponding path program 1 times [2024-11-09 01:41:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:41:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947851021] [2024-11-09 01:41:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:41:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:41:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:41:58,730 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-11-09 01:41:58,767 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-11-09 01:41:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:41:59,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 01:41:59,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:42:00,231 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 8 treesize of output 1 [2024-11-09 01:42:00,813 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 34 treesize of output 18 [2024-11-09 01:42:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-09 01:42:02,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2024-11-09 01:42:03,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2024-11-09 01:42:03,455 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 17 treesize of output 13 [2024-11-09 01:42:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-09 01:42:03,974 INFO L349 Elim1Store]: treesize reduction 3, result has 93.9 percent of original size [2024-11-09 01:42:03,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 98 [2024-11-09 01:42:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 147 proven. 244 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 01:42:04,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:42:13,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:42:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947851021] [2024-11-09 01:42:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947851021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:42:13,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [406324845] [2024-11-09 01:42:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:42:13,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:42:13,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:42:13,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:42:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 01:42:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:42:14,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 01:42:14,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:42:16,018 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 21 treesize of output 20 [2024-11-09 01:42:17,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2024-11-09 01:42:20,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2024-11-09 01:42:21,545 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 0 case distinctions, treesize of input 73 treesize of output 55 [2024-11-09 01:42:23,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2024-11-09 01:42:24,067 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 17 treesize of output 13 [2024-11-09 01:42:24,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-09 01:42:25,450 INFO L349 Elim1Store]: treesize reduction 3, result has 93.9 percent of original size [2024-11-09 01:42:25,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 94 [2024-11-09 01:42:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 152 proven. 244 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:42:25,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:42:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [406324845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:42:26,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:42:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2024-11-09 01:42:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171912506] [2024-11-09 01:42:26,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:42:26,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-09 01:42:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:42:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-09 01:42:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=3342, Unknown=2, NotChecked=0, Total=3782 [2024-11-09 01:42:26,258 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 54 states, 46 states have (on average 2.717391304347826) internal successors, (125), 44 states have internal predecessors, (125), 14 states have call successors, (32), 13 states have call predecessors, (32), 14 states have return successors, (32), 13 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-09 01:42:30,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:42:43,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]