./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-13.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 ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:17:04,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:17:04,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:17:04,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:17:04,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:17:04,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:17:04,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:17:04,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:17:04,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:17:04,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:17:04,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:17:04,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:17:04,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:17:04,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:17:04,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:17:04,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:17:04,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:17:04,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:17:04,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:17:04,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:17:04,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:17:04,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:17:04,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:17:04,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:17:04,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:17:04,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:17:04,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:17:04,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:17:04,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:17:04,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:17:04,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:17:04,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:17:04,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:17:04,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:17:04,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:17:04,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:17:04,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:17:04,799 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 -> ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc [2024-11-12 07:17:05,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:17:05,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:17:05,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:17:05,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:17:05,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:17:05,045 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-13.i [2024-11-12 07:17:06,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:17:06,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:17:06,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2024-11-12 07:17:06,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df052686e/3e739c0160b94396a88db463915118de/FLAG844e15d98 [2024-11-12 07:17:07,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df052686e/3e739c0160b94396a88db463915118de [2024-11-12 07:17:07,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:17:07,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:17:07,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:17:07,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:17:07,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:17:07,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@815d04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07, skipping insertion in model container [2024-11-12 07:17:07,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:17:07,501 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-13.i[917,930] [2024-11-12 07:17:07,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:17:07,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:17:07,587 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-13.i[917,930] [2024-11-12 07:17:07,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:17:07,639 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:17:07,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07 WrapperNode [2024-11-12 07:17:07,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:17:07,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:17:07,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:17:07,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:17:07,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,697 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-11-12 07:17:07,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:17:07,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:17:07,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:17:07,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:17:07,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,736 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2024-11-12 07:17:07,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:17:07,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:17:07,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:17:07,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:17:07,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (1/1) ... [2024-11-12 07:17:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:17:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:17:07,810 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-12 07:17:07,813 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-12 07:17:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:17:07,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:17:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:17:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:17:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:17:07,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:17:07,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:17:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:17:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:17:07,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:17:07,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:17:07,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:17:07,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:17:07,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:17:07,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:17:07,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:17:08,403 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-12 07:17:08,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:17:08,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:17:08,419 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:17:08,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:17:08 BoogieIcfgContainer [2024-11-12 07:17:08,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:17:08,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:17:08,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:17:08,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:17:08,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:17:07" (1/3) ... [2024-11-12 07:17:08,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375fc788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:17:08, skipping insertion in model container [2024-11-12 07:17:08,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:07" (2/3) ... [2024-11-12 07:17:08,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375fc788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:17:08, skipping insertion in model container [2024-11-12 07:17:08,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:17:08" (3/3) ... [2024-11-12 07:17:08,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-13.i [2024-11-12 07:17:08,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:17:08,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:17:08,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:17:08,496 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;@7412b733, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:17:08,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:17:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:17:08,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:08,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:08,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 937167592, now seen corresponding path program 1 times [2024-11-12 07:17:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:08,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145777005] [2024-11-12 07:17:08,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:08,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145777005] [2024-11-12 07:17:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145777005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:08,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:08,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:17:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672303] [2024-11-12 07:17:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:17:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:17:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:17:08,983 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:09,043 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-12 07:17:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:17:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:17:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:09,052 INFO L225 Difference]: With dead ends: 217 [2024-11-12 07:17:09,052 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:17:09,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-12 07:17:09,059 INFO L435 NwaCegarLoop]: 159 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, 159 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-12 07:17:09,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:17:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:17:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-12 07:17:09,106 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-12 07:17:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-12 07:17:09,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-12 07:17:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:17:09,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:09,114 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:09,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:17:09,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 78624018, now seen corresponding path program 1 times [2024-11-12 07:17:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262475684] [2024-11-12 07:17:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262475684] [2024-11-12 07:17:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262475684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:09,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:17:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885818679] [2024-11-12 07:17:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:17:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:17:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:09,425 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:09,474 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2024-11-12 07:17:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:17:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:09,476 INFO L225 Difference]: With dead ends: 215 [2024-11-12 07:17:09,478 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:17:09,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:09,480 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:09,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:17:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:17:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-12 07:17:09,489 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2024-11-12 07:17:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:09,491 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-12 07:17:09,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-11-12 07:17:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:17:09,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:09,493 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:09,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:17:09,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:09,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1923262252, now seen corresponding path program 1 times [2024-11-12 07:17:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:09,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342975258] [2024-11-12 07:17:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342975258] [2024-11-12 07:17:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342975258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:17:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585430557] [2024-11-12 07:17:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:09,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:17:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:17:09,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:09,838 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:09,909 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2024-11-12 07:17:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:17:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:09,912 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:17:09,912 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 07:17:09,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:09,913 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:09,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 07:17:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 07:17:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2024-11-12 07:17:09,941 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 131 [2024-11-12 07:17:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:09,941 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2024-11-12 07:17:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2024-11-12 07:17:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:17:09,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:09,949 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:09,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:17:09,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2088778033, now seen corresponding path program 1 times [2024-11-12 07:17:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586195262] [2024-11-12 07:17:09,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:10,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586195262] [2024-11-12 07:17:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586195262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125157225] [2024-11-12 07:17:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:10,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:10,405 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:10,528 INFO L93 Difference]: Finished difference Result 330 states and 483 transitions. [2024-11-12 07:17:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:10,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-12 07:17:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:10,532 INFO L225 Difference]: With dead ends: 330 [2024-11-12 07:17:10,532 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 07:17:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:10,536 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 114 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:10,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 573 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 07:17:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2024-11-12 07:17:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:17:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 312 transitions. [2024-11-12 07:17:10,563 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 312 transitions. Word has length 133 [2024-11-12 07:17:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 312 transitions. [2024-11-12 07:17:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2024-11-12 07:17:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:17:10,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:10,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:17:10,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1388540813, now seen corresponding path program 1 times [2024-11-12 07:17:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392144393] [2024-11-12 07:17:10,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392144393] [2024-11-12 07:17:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392144393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699279536] [2024-11-12 07:17:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:10,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:10,818 INFO L87 Difference]: Start difference. First operand 213 states and 312 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:10,900 INFO L93 Difference]: Finished difference Result 463 states and 678 transitions. [2024-11-12 07:17:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:17:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-12 07:17:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:10,903 INFO L225 Difference]: With dead ends: 463 [2024-11-12 07:17:10,903 INFO L226 Difference]: Without dead ends: 253 [2024-11-12 07:17:10,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-12 07:17:10,904 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 52 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:10,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 607 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-12 07:17:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2024-11-12 07:17:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.402116402116402) internal successors, (265), 189 states have internal predecessors, (265), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:17:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2024-11-12 07:17:10,931 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 133 [2024-11-12 07:17:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:10,931 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2024-11-12 07:17:10,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2024-11-12 07:17:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:10,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:10,932 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:10,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:17:10,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1223822753, now seen corresponding path program 1 times [2024-11-12 07:17:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:10,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615629397] [2024-11-12 07:17:10,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615629397] [2024-11-12 07:17:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615629397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954100399] [2024-11-12 07:17:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:11,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:11,355 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:11,468 INFO L93 Difference]: Finished difference Result 449 states and 657 transitions. [2024-11-12 07:17:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-12 07:17:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:11,471 INFO L225 Difference]: With dead ends: 449 [2024-11-12 07:17:11,471 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 07:17:11,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:11,476 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 180 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:11,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 431 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 07:17:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 222. [2024-11-12 07:17:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 189 states have internal predecessors, (264), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:17:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 324 transitions. [2024-11-12 07:17:11,524 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 324 transitions. Word has length 134 [2024-11-12 07:17:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:11,525 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 324 transitions. [2024-11-12 07:17:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 324 transitions. [2024-11-12 07:17:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:11,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:11,527 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:17:11,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:11,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -522758175, now seen corresponding path program 1 times [2024-11-12 07:17:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046041935] [2024-11-12 07:17:11,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046041935] [2024-11-12 07:17:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046041935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906293587] [2024-11-12 07:17:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:11,997 INFO L87 Difference]: Start difference. First operand 222 states and 324 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:12,189 INFO L93 Difference]: Finished difference Result 609 states and 887 transitions. [2024-11-12 07:17:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:17:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-12 07:17:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:12,192 INFO L225 Difference]: With dead ends: 609 [2024-11-12 07:17:12,192 INFO L226 Difference]: Without dead ends: 390 [2024-11-12 07:17:12,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:17:12,194 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 260 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:12,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 877 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-12 07:17:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2024-11-12 07:17:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.407079646017699) internal successors, (477), 341 states have internal predecessors, (477), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:17:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 561 transitions. [2024-11-12 07:17:12,214 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 561 transitions. Word has length 134 [2024-11-12 07:17:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:12,214 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 561 transitions. [2024-11-12 07:17:12,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 561 transitions. [2024-11-12 07:17:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:12,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:12,216 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:12,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:17:12,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -915785185, now seen corresponding path program 1 times [2024-11-12 07:17:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767768548] [2024-11-12 07:17:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:12,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:12,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767768548] [2024-11-12 07:17:12,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767768548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:12,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:12,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424487813] [2024-11-12 07:17:12,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:12,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:12,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:12,424 INFO L87 Difference]: Start difference. First operand 386 states and 561 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:12,471 INFO L93 Difference]: Finished difference Result 830 states and 1203 transitions. [2024-11-12 07:17:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:17:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-12 07:17:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:12,475 INFO L225 Difference]: With dead ends: 830 [2024-11-12 07:17:12,475 INFO L226 Difference]: Without dead ends: 447 [2024-11-12 07:17:12,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-12 07:17:12,477 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:12,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 606 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-12 07:17:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 386. [2024-11-12 07:17:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.3952802359882006) internal successors, (473), 341 states have internal predecessors, (473), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:17:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 557 transitions. [2024-11-12 07:17:12,493 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 557 transitions. Word has length 134 [2024-11-12 07:17:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:12,493 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 557 transitions. [2024-11-12 07:17:12,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 557 transitions. [2024-11-12 07:17:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:12,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:12,495 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:12,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:17:12,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:12,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1385037405, now seen corresponding path program 1 times [2024-11-12 07:17:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348231953] [2024-11-12 07:17:12,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348231953] [2024-11-12 07:17:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348231953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358796703] [2024-11-12 07:17:13,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:13,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:13,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:13,184 INFO L87 Difference]: Start difference. First operand 386 states and 557 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:13,505 INFO L93 Difference]: Finished difference Result 896 states and 1291 transitions. [2024-11-12 07:17:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:13,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-12 07:17:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:13,512 INFO L225 Difference]: With dead ends: 896 [2024-11-12 07:17:13,519 INFO L226 Difference]: Without dead ends: 513 [2024-11-12 07:17:13,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:13,520 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 119 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:13,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 714 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:17:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-12 07:17:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2024-11-12 07:17:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 433 states have (on average 1.3810623556581987) internal successors, (598), 436 states have internal predecessors, (598), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:17:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 718 transitions. [2024-11-12 07:17:13,547 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 718 transitions. Word has length 134 [2024-11-12 07:17:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:13,547 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 718 transitions. [2024-11-12 07:17:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 718 transitions. [2024-11-12 07:17:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:13,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:13,549 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:17:13,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash 960415965, now seen corresponding path program 1 times [2024-11-12 07:17:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020309320] [2024-11-12 07:17:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:14,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020309320] [2024-11-12 07:17:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020309320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642385897] [2024-11-12 07:17:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:14,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:14,044 INFO L87 Difference]: Start difference. First operand 501 states and 718 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:14,308 INFO L93 Difference]: Finished difference Result 1092 states and 1562 transitions. [2024-11-12 07:17:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:17:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-12 07:17:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:14,311 INFO L225 Difference]: With dead ends: 1092 [2024-11-12 07:17:14,311 INFO L226 Difference]: Without dead ends: 594 [2024-11-12 07:17:14,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:14,313 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 220 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:14,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 475 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:17:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-12 07:17:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 590. [2024-11-12 07:17:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 508 states have (on average 1.374015748031496) internal successors, (698), 512 states have internal predecessors, (698), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 07:17:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 842 transitions. [2024-11-12 07:17:14,351 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 842 transitions. Word has length 134 [2024-11-12 07:17:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:14,352 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 842 transitions. [2024-11-12 07:17:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 842 transitions. [2024-11-12 07:17:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:17:14,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:14,353 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:14,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:17:14,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 567388955, now seen corresponding path program 1 times [2024-11-12 07:17:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736733710] [2024-11-12 07:17:14,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736733710] [2024-11-12 07:17:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736733710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:14,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:17:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866245900] [2024-11-12 07:17:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:17:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:14,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:17:14,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:14,572 INFO L87 Difference]: Start difference. First operand 590 states and 842 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:14,697 INFO L93 Difference]: Finished difference Result 1234 states and 1754 transitions. [2024-11-12 07:17:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:14,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-12 07:17:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:14,701 INFO L225 Difference]: With dead ends: 1234 [2024-11-12 07:17:14,701 INFO L226 Difference]: Without dead ends: 647 [2024-11-12 07:17:14,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:17:14,703 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 106 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:14,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1122 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-12 07:17:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 502. [2024-11-12 07:17:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 432 states have (on average 1.3634259259259258) internal successors, (589), 435 states have internal predecessors, (589), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:17:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 709 transitions. [2024-11-12 07:17:14,738 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 709 transitions. Word has length 134 [2024-11-12 07:17:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:14,739 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 709 transitions. [2024-11-12 07:17:14,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 709 transitions. [2024-11-12 07:17:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:14,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:14,740 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:14,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:17:14,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1516228552, now seen corresponding path program 1 times [2024-11-12 07:17:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494439306] [2024-11-12 07:17:14,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494439306] [2024-11-12 07:17:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494439306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:17:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336306363] [2024-11-12 07:17:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:14,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:17:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:17:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:14,892 INFO L87 Difference]: Start difference. First operand 502 states and 709 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:14,929 INFO L93 Difference]: Finished difference Result 767 states and 1087 transitions. [2024-11-12 07:17:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:17:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:14,935 INFO L225 Difference]: With dead ends: 767 [2024-11-12 07:17:14,935 INFO L226 Difference]: Without dead ends: 494 [2024-11-12 07:17:14,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:14,936 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:14,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-12 07:17:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-12 07:17:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 424 states have (on average 1.3419811320754718) internal successors, (569), 427 states have internal predecessors, (569), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:17:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 689 transitions. [2024-11-12 07:17:14,968 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 689 transitions. Word has length 135 [2024-11-12 07:17:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:14,968 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 689 transitions. [2024-11-12 07:17:14,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 689 transitions. [2024-11-12 07:17:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:14,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:14,969 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:14,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:17:14,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:14,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 358139828, now seen corresponding path program 1 times [2024-11-12 07:17:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600983939] [2024-11-12 07:17:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:14,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600983939] [2024-11-12 07:17:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600983939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:15,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995989532] [2024-11-12 07:17:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:15,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:15,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:15,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:15,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:15,446 INFO L87 Difference]: Start difference. First operand 494 states and 689 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:15,898 INFO L93 Difference]: Finished difference Result 1301 states and 1810 transitions. [2024-11-12 07:17:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:17:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:15,905 INFO L225 Difference]: With dead ends: 1301 [2024-11-12 07:17:15,905 INFO L226 Difference]: Without dead ends: 1036 [2024-11-12 07:17:15,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:17:15,906 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 323 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:15,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1321 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:17:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-12 07:17:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 867. [2024-11-12 07:17:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 748 states have (on average 1.338235294117647) internal successors, (1001), 752 states have internal predecessors, (1001), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1205 transitions. [2024-11-12 07:17:15,984 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1205 transitions. Word has length 135 [2024-11-12 07:17:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1205 transitions. [2024-11-12 07:17:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1205 transitions. [2024-11-12 07:17:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:15,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:15,987 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:17:15,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -459508622, now seen corresponding path program 1 times [2024-11-12 07:17:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643667016] [2024-11-12 07:17:15,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643667016] [2024-11-12 07:17:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643667016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:17:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262875263] [2024-11-12 07:17:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:17:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:17:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:16,104 INFO L87 Difference]: Start difference. First operand 867 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:16,155 INFO L93 Difference]: Finished difference Result 1390 states and 1939 transitions. [2024-11-12 07:17:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:17:16,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:16,161 INFO L225 Difference]: With dead ends: 1390 [2024-11-12 07:17:16,161 INFO L226 Difference]: Without dead ends: 867 [2024-11-12 07:17:16,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:16,164 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:16,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-12 07:17:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-11-12 07:17:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 748 states have (on average 1.335561497326203) internal successors, (999), 752 states have internal predecessors, (999), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1203 transitions. [2024-11-12 07:17:16,221 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1203 transitions. Word has length 135 [2024-11-12 07:17:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1203 transitions. [2024-11-12 07:17:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1203 transitions. [2024-11-12 07:17:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:16,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:16,223 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:17:16,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2030020340, now seen corresponding path program 1 times [2024-11-12 07:17:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220654654] [2024-11-12 07:17:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220654654] [2024-11-12 07:17:16,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220654654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:16,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:16,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:17:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141240251] [2024-11-12 07:17:16,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:16,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:17:16,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:17:16,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:16,402 INFO L87 Difference]: Start difference. First operand 867 states and 1203 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:16,485 INFO L93 Difference]: Finished difference Result 1390 states and 1935 transitions. [2024-11-12 07:17:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:16,490 INFO L225 Difference]: With dead ends: 1390 [2024-11-12 07:17:16,490 INFO L226 Difference]: Without dead ends: 867 [2024-11-12 07:17:16,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:17:16,493 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:16,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-12 07:17:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-11-12 07:17:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 748 states have (on average 1.3248663101604279) internal successors, (991), 752 states have internal predecessors, (991), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1195 transitions. [2024-11-12 07:17:16,565 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1195 transitions. Word has length 135 [2024-11-12 07:17:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1195 transitions. [2024-11-12 07:17:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1195 transitions. [2024-11-12 07:17:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:16,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:16,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:16,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:17:16,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2006781518, now seen corresponding path program 1 times [2024-11-12 07:17:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:16,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30060537] [2024-11-12 07:17:16,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:17,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30060537] [2024-11-12 07:17:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30060537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:17,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:17,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:17:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342745048] [2024-11-12 07:17:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:17,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:17:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:17:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:17:17,196 INFO L87 Difference]: Start difference. First operand 867 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:17,710 INFO L93 Difference]: Finished difference Result 1220 states and 1678 transitions. [2024-11-12 07:17:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:17:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:17,721 INFO L225 Difference]: With dead ends: 1220 [2024-11-12 07:17:17,722 INFO L226 Difference]: Without dead ends: 960 [2024-11-12 07:17:17,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:17:17,723 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 266 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:17,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2559 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:17:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-12 07:17:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 863. [2024-11-12 07:17:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 744 states have (on average 1.3239247311827957) internal successors, (985), 748 states have internal predecessors, (985), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1189 transitions. [2024-11-12 07:17:17,822 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1189 transitions. Word has length 135 [2024-11-12 07:17:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:17,822 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1189 transitions. [2024-11-12 07:17:17,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1189 transitions. [2024-11-12 07:17:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:17,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:17,827 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:17:17,828 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1127093454, now seen corresponding path program 1 times [2024-11-12 07:17:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943664415] [2024-11-12 07:17:17,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:18,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943664415] [2024-11-12 07:17:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943664415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:18,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:17:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005493469] [2024-11-12 07:17:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:17:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:17:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:17:18,361 INFO L87 Difference]: Start difference. First operand 863 states and 1189 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:19,092 INFO L93 Difference]: Finished difference Result 1591 states and 2192 transitions. [2024-11-12 07:17:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:17:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:19,097 INFO L225 Difference]: With dead ends: 1591 [2024-11-12 07:17:19,097 INFO L226 Difference]: Without dead ends: 1072 [2024-11-12 07:17:19,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:17:19,098 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 220 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:19,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1872 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:17:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-12 07:17:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 881. [2024-11-12 07:17:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 762 states have (on average 1.3241469816272966) internal successors, (1009), 766 states have internal predecessors, (1009), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1213 transitions. [2024-11-12 07:17:19,141 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1213 transitions. Word has length 135 [2024-11-12 07:17:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:19,141 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1213 transitions. [2024-11-12 07:17:19,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1213 transitions. [2024-11-12 07:17:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:17:19,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:19,143 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:17:19,143 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1944741904, now seen corresponding path program 1 times [2024-11-12 07:17:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620914932] [2024-11-12 07:17:19,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620914932] [2024-11-12 07:17:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620914932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090280930] [2024-11-12 07:17:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:19,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:19,480 INFO L87 Difference]: Start difference. First operand 881 states and 1213 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:20,118 INFO L93 Difference]: Finished difference Result 1470 states and 2024 transitions. [2024-11-12 07:17:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:17:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:17:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:20,127 INFO L225 Difference]: With dead ends: 1470 [2024-11-12 07:17:20,127 INFO L226 Difference]: Without dead ends: 933 [2024-11-12 07:17:20,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:17:20,129 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 207 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:20,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1414 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:17:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-12 07:17:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 844. [2024-11-12 07:17:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 725 states have (on average 1.3144827586206898) internal successors, (953), 729 states have internal predecessors, (953), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1157 transitions. [2024-11-12 07:17:20,188 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1157 transitions. Word has length 135 [2024-11-12 07:17:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:20,188 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1157 transitions. [2024-11-12 07:17:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1157 transitions. [2024-11-12 07:17:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:17:20,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:20,190 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:20,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:17:20,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:20,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:20,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1096531644, now seen corresponding path program 1 times [2024-11-12 07:17:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885764526] [2024-11-12 07:17:20,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885764526] [2024-11-12 07:17:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885764526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:20,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:20,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:20,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366389286] [2024-11-12 07:17:20,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:20,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:20,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:20,883 INFO L87 Difference]: Start difference. First operand 844 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:21,352 INFO L93 Difference]: Finished difference Result 1751 states and 2411 transitions. [2024-11-12 07:17:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:17:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-12 07:17:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:21,358 INFO L225 Difference]: With dead ends: 1751 [2024-11-12 07:17:21,358 INFO L226 Difference]: Without dead ends: 1251 [2024-11-12 07:17:21,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:17:21,360 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 434 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:21,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 631 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:17:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-12 07:17:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 848. [2024-11-12 07:17:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 729 states have (on average 1.3155006858710563) internal successors, (959), 733 states have internal predecessors, (959), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 07:17:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1163 transitions. [2024-11-12 07:17:21,412 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1163 transitions. Word has length 136 [2024-11-12 07:17:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1163 transitions. [2024-11-12 07:17:21,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1163 transitions. [2024-11-12 07:17:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:17:21,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:21,416 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:17:21,416 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1185714494, now seen corresponding path program 1 times [2024-11-12 07:17:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360015405] [2024-11-12 07:17:21,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360015405] [2024-11-12 07:17:21,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360015405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:21,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:21,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:17:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81590081] [2024-11-12 07:17:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:21,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:17:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:17:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:21,803 INFO L87 Difference]: Start difference. First operand 848 states and 1163 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:21,940 INFO L93 Difference]: Finished difference Result 1793 states and 2464 transitions. [2024-11-12 07:17:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:17:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-12 07:17:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:21,945 INFO L225 Difference]: With dead ends: 1793 [2024-11-12 07:17:21,945 INFO L226 Difference]: Without dead ends: 1289 [2024-11-12 07:17:21,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:21,947 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:21,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 418 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-12 07:17:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1283. [2024-11-12 07:17:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1102 states have (on average 1.3121597096188748) internal successors, (1446), 1108 states have internal predecessors, (1446), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1758 transitions. [2024-11-12 07:17:22,031 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1758 transitions. Word has length 136 [2024-11-12 07:17:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:22,031 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1758 transitions. [2024-11-12 07:17:22,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1758 transitions. [2024-11-12 07:17:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:17:22,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:22,033 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:22,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:17:22,034 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:22,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -484649916, now seen corresponding path program 1 times [2024-11-12 07:17:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145357636] [2024-11-12 07:17:22,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:22,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145357636] [2024-11-12 07:17:22,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145357636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:22,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098966526] [2024-11-12 07:17:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:22,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:22,975 INFO L87 Difference]: Start difference. First operand 1283 states and 1758 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:23,697 INFO L93 Difference]: Finished difference Result 2925 states and 4030 transitions. [2024-11-12 07:17:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-12 07:17:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:23,714 INFO L225 Difference]: With dead ends: 2925 [2024-11-12 07:17:23,717 INFO L226 Difference]: Without dead ends: 1986 [2024-11-12 07:17:23,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:17:23,724 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 312 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:23,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 516 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:17:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2024-11-12 07:17:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1257. [2024-11-12 07:17:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1076 states have (on average 1.3141263940520447) internal successors, (1414), 1082 states have internal predecessors, (1414), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1726 transitions. [2024-11-12 07:17:24,007 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1726 transitions. Word has length 136 [2024-11-12 07:17:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:24,011 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1726 transitions. [2024-11-12 07:17:24,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1726 transitions. [2024-11-12 07:17:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:17:24,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:24,013 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:17:24,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 664524950, now seen corresponding path program 1 times [2024-11-12 07:17:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558661985] [2024-11-12 07:17:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558661985] [2024-11-12 07:17:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558661985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172838802] [2024-11-12 07:17:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:24,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:24,537 INFO L87 Difference]: Start difference. First operand 1257 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:24,840 INFO L93 Difference]: Finished difference Result 1597 states and 2191 transitions. [2024-11-12 07:17:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:17:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-12 07:17:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:24,846 INFO L225 Difference]: With dead ends: 1597 [2024-11-12 07:17:24,846 INFO L226 Difference]: Without dead ends: 1346 [2024-11-12 07:17:24,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:17:24,849 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 241 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1695 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:17:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2024-11-12 07:17:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1263. [2024-11-12 07:17:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1082 states have (on average 1.3123844731977818) internal successors, (1420), 1088 states have internal predecessors, (1420), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1732 transitions. [2024-11-12 07:17:24,950 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1732 transitions. Word has length 136 [2024-11-12 07:17:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:24,950 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1732 transitions. [2024-11-12 07:17:24,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1732 transitions. [2024-11-12 07:17:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:17:24,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:24,951 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:17:24,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1004230120, now seen corresponding path program 1 times [2024-11-12 07:17:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116790522] [2024-11-12 07:17:24,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116790522] [2024-11-12 07:17:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116790522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:25,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:25,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838808606] [2024-11-12 07:17:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:25,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:25,150 INFO L87 Difference]: Start difference. First operand 1263 states and 1732 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:25,386 INFO L93 Difference]: Finished difference Result 2347 states and 3217 transitions. [2024-11-12 07:17:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:25,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-12 07:17:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:25,393 INFO L225 Difference]: With dead ends: 2347 [2024-11-12 07:17:25,393 INFO L226 Difference]: Without dead ends: 1418 [2024-11-12 07:17:25,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:25,395 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 203 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:25,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 655 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-11-12 07:17:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1258. [2024-11-12 07:17:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1077 states have (on average 1.308263695450325) internal successors, (1409), 1083 states have internal predecessors, (1409), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1721 transitions. [2024-11-12 07:17:25,467 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1721 transitions. Word has length 136 [2024-11-12 07:17:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:25,468 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1721 transitions. [2024-11-12 07:17:25,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1721 transitions. [2024-11-12 07:17:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:17:25,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:25,469 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:25,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 07:17:25,469 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -900403029, now seen corresponding path program 1 times [2024-11-12 07:17:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831631622] [2024-11-12 07:17:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831631622] [2024-11-12 07:17:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831631622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:26,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:26,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:17:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826479710] [2024-11-12 07:17:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:17:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:17:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:17:26,175 INFO L87 Difference]: Start difference. First operand 1258 states and 1721 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:26,758 INFO L93 Difference]: Finished difference Result 1615 states and 2204 transitions. [2024-11-12 07:17:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:17:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-12 07:17:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:26,763 INFO L225 Difference]: With dead ends: 1615 [2024-11-12 07:17:26,763 INFO L226 Difference]: Without dead ends: 1353 [2024-11-12 07:17:26,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:17:26,765 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 497 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:26,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1878 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:17:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-12 07:17:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1254. [2024-11-12 07:17:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1073 states have (on average 1.3075489282385835) internal successors, (1403), 1079 states have internal predecessors, (1403), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1715 transitions. [2024-11-12 07:17:26,853 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1715 transitions. Word has length 137 [2024-11-12 07:17:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1715 transitions. [2024-11-12 07:17:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1715 transitions. [2024-11-12 07:17:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:17:26,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:26,855 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:26,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:17:26,855 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:26,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1628730837, now seen corresponding path program 1 times [2024-11-12 07:17:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890156831] [2024-11-12 07:17:26,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890156831] [2024-11-12 07:17:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890156831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:17:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59506464] [2024-11-12 07:17:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:17:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:27,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:17:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:17:27,938 INFO L87 Difference]: Start difference. First operand 1254 states and 1715 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:28,698 INFO L93 Difference]: Finished difference Result 1927 states and 2631 transitions. [2024-11-12 07:17:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:17:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-12 07:17:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:28,705 INFO L225 Difference]: With dead ends: 1927 [2024-11-12 07:17:28,705 INFO L226 Difference]: Without dead ends: 1431 [2024-11-12 07:17:28,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:17:28,708 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 231 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:28,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 2003 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:17:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-11-12 07:17:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1256. [2024-11-12 07:17:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1075 states have (on average 1.307906976744186) internal successors, (1406), 1081 states have internal predecessors, (1406), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1718 transitions. [2024-11-12 07:17:28,800 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1718 transitions. Word has length 137 [2024-11-12 07:17:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:28,800 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1718 transitions. [2024-11-12 07:17:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1718 transitions. [2024-11-12 07:17:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:17:28,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:28,802 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 07:17:28,802 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1639022909, now seen corresponding path program 1 times [2024-11-12 07:17:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758325553] [2024-11-12 07:17:28,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:29,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758325553] [2024-11-12 07:17:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758325553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:17:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464084362] [2024-11-12 07:17:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:17:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:17:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:17:29,277 INFO L87 Difference]: Start difference. First operand 1256 states and 1718 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:29,758 INFO L93 Difference]: Finished difference Result 1603 states and 2188 transitions. [2024-11-12 07:17:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:17:29,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-12 07:17:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:29,768 INFO L225 Difference]: With dead ends: 1603 [2024-11-12 07:17:29,768 INFO L226 Difference]: Without dead ends: 1345 [2024-11-12 07:17:29,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:17:29,770 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 471 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:29,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1390 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:17:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-12 07:17:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1248. [2024-11-12 07:17:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1067 states have (on average 1.3083411433926897) internal successors, (1396), 1073 states have internal predecessors, (1396), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1708 transitions. [2024-11-12 07:17:29,850 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1708 transitions. Word has length 138 [2024-11-12 07:17:29,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:29,850 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1708 transitions. [2024-11-12 07:17:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1708 transitions. [2024-11-12 07:17:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:17:29,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:29,851 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:29,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 07:17:29,851 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:29,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 624880191, now seen corresponding path program 1 times [2024-11-12 07:17:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389542207] [2024-11-12 07:17:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:29,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:29,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389542207] [2024-11-12 07:17:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389542207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:29,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:29,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394879442] [2024-11-12 07:17:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:29,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:29,972 INFO L87 Difference]: Start difference. First operand 1248 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:30,067 INFO L93 Difference]: Finished difference Result 1795 states and 2452 transitions. [2024-11-12 07:17:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:17:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2024-11-12 07:17:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:30,072 INFO L225 Difference]: With dead ends: 1795 [2024-11-12 07:17:30,073 INFO L226 Difference]: Without dead ends: 1305 [2024-11-12 07:17:30,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-12 07:17:30,074 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 50 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:30,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 704 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2024-11-12 07:17:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1248. [2024-11-12 07:17:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1067 states have (on average 1.3045923149015932) internal successors, (1392), 1073 states have internal predecessors, (1392), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1704 transitions. [2024-11-12 07:17:30,151 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1704 transitions. Word has length 138 [2024-11-12 07:17:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:30,151 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1704 transitions. [2024-11-12 07:17:30,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1704 transitions. [2024-11-12 07:17:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:17:30,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:30,154 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 07:17:30,155 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1052110624, now seen corresponding path program 1 times [2024-11-12 07:17:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889513617] [2024-11-12 07:17:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:30,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889513617] [2024-11-12 07:17:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889513617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:30,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:17:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828610851] [2024-11-12 07:17:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:17:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:17:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:30,297 INFO L87 Difference]: Start difference. First operand 1248 states and 1704 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:30,377 INFO L93 Difference]: Finished difference Result 2502 states and 3407 transitions. [2024-11-12 07:17:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-12 07:17:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:30,383 INFO L225 Difference]: With dead ends: 2502 [2024-11-12 07:17:30,383 INFO L226 Difference]: Without dead ends: 1292 [2024-11-12 07:17:30,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:30,385 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:30,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-11-12 07:17:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2024-11-12 07:17:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1111 states have (on average 1.2925292529252925) internal successors, (1436), 1117 states have internal predecessors, (1436), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1748 transitions. [2024-11-12 07:17:30,457 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1748 transitions. Word has length 139 [2024-11-12 07:17:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1748 transitions. [2024-11-12 07:17:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1748 transitions. [2024-11-12 07:17:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:17:30,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:30,458 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:30,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 07:17:30,459 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1163214930, now seen corresponding path program 1 times [2024-11-12 07:17:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939928918] [2024-11-12 07:17:30,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:30,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939928918] [2024-11-12 07:17:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939928918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:17:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280494170] [2024-11-12 07:17:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:30,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:17:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:17:30,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:30,518 INFO L87 Difference]: Start difference. First operand 1292 states and 1748 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:30,583 INFO L93 Difference]: Finished difference Result 2524 states and 3407 transitions. [2024-11-12 07:17:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:17:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-12 07:17:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:30,592 INFO L225 Difference]: With dead ends: 2524 [2024-11-12 07:17:30,593 INFO L226 Difference]: Without dead ends: 1270 [2024-11-12 07:17:30,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:17:30,599 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:30,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-11-12 07:17:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2024-11-12 07:17:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1089 states have (on average 1.278236914600551) internal successors, (1392), 1095 states have internal predecessors, (1392), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 07:17:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1704 transitions. [2024-11-12 07:17:30,671 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1704 transitions. Word has length 139 [2024-11-12 07:17:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1704 transitions. [2024-11-12 07:17:30,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1704 transitions. [2024-11-12 07:17:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:17:30,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:30,673 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:30,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 07:17:30,673 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:30,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1571288474, now seen corresponding path program 1 times [2024-11-12 07:17:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382409669] [2024-11-12 07:17:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382409669] [2024-11-12 07:17:31,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382409669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:31,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:31,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:17:31,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850622255] [2024-11-12 07:17:31,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:31,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:17:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:17:31,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:17:31,058 INFO L87 Difference]: Start difference. First operand 1270 states and 1704 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:31,346 INFO L93 Difference]: Finished difference Result 2197 states and 2930 transitions. [2024-11-12 07:17:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:17:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 140 [2024-11-12 07:17:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:31,351 INFO L225 Difference]: With dead ends: 2197 [2024-11-12 07:17:31,351 INFO L226 Difference]: Without dead ends: 1253 [2024-11-12 07:17:31,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:17:31,354 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 204 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:31,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 985 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:17:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-12 07:17:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 797. [2024-11-12 07:17:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 686 states have (on average 1.271137026239067) internal successors, (872), 688 states have internal predecessors, (872), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 07:17:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1058 transitions. [2024-11-12 07:17:31,407 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1058 transitions. Word has length 140 [2024-11-12 07:17:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:31,408 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1058 transitions. [2024-11-12 07:17:31,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1058 transitions. [2024-11-12 07:17:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:17:31,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:31,409 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 07:17:31,409 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1146802395, now seen corresponding path program 1 times [2024-11-12 07:17:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112037571] [2024-11-12 07:17:31,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112037571] [2024-11-12 07:17:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112037571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:31,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:17:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759209166] [2024-11-12 07:17:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:31,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:17:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:17:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:17:31,541 INFO L87 Difference]: Start difference. First operand 797 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:31,618 INFO L93 Difference]: Finished difference Result 1614 states and 2131 transitions. [2024-11-12 07:17:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:17:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2024-11-12 07:17:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:31,622 INFO L225 Difference]: With dead ends: 1614 [2024-11-12 07:17:31,622 INFO L226 Difference]: Without dead ends: 855 [2024-11-12 07:17:31,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-12 07:17:31,623 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 34 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:31,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 563 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-12 07:17:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 811. [2024-11-12 07:17:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 700 states have (on average 1.26) internal successors, (882), 702 states have internal predecessors, (882), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 07:17:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1068 transitions. [2024-11-12 07:17:31,696 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1068 transitions. Word has length 141 [2024-11-12 07:17:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:31,697 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1068 transitions. [2024-11-12 07:17:31,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1068 transitions. [2024-11-12 07:17:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 07:17:31,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:31,698 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:31,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 07:17:31,699 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 559996381, now seen corresponding path program 1 times [2024-11-12 07:17:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730883845] [2024-11-12 07:17:31,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730883845] [2024-11-12 07:17:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730883845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:32,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:17:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464194666] [2024-11-12 07:17:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:17:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:17:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:17:32,005 INFO L87 Difference]: Start difference. First operand 811 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:32,222 INFO L93 Difference]: Finished difference Result 1905 states and 2490 transitions. [2024-11-12 07:17:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:17:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2024-11-12 07:17:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:32,226 INFO L225 Difference]: With dead ends: 1905 [2024-11-12 07:17:32,226 INFO L226 Difference]: Without dead ends: 1132 [2024-11-12 07:17:32,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:32,232 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 80 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:32,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 825 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-12 07:17:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 921. [2024-11-12 07:17:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 810 states have (on average 1.2271604938271605) internal successors, (994), 812 states have internal predecessors, (994), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 07:17:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1180 transitions. [2024-11-12 07:17:32,335 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1180 transitions. Word has length 141 [2024-11-12 07:17:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1180 transitions. [2024-11-12 07:17:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1180 transitions. [2024-11-12 07:17:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:17:32,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:32,336 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 07:17:32,337 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 25599706, now seen corresponding path program 1 times [2024-11-12 07:17:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791588393] [2024-11-12 07:17:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:17:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:17:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:17:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:17:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:17:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:17:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:17:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:17:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:17:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:17:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:17:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:17:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:17:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:17:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:17:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:17:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791588393] [2024-11-12 07:17:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791588393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:17:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400267000] [2024-11-12 07:17:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:17:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:17:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:17:32,612 INFO L87 Difference]: Start difference. First operand 921 states and 1180 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:32,779 INFO L93 Difference]: Finished difference Result 947 states and 1210 transitions. [2024-11-12 07:17:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:17:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2024-11-12 07:17:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:32,783 INFO L225 Difference]: With dead ends: 947 [2024-11-12 07:17:32,783 INFO L226 Difference]: Without dead ends: 945 [2024-11-12 07:17:32,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 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-12 07:17:32,784 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 121 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:32,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1240 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:17:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-12 07:17:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2024-11-12 07:17:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 832 states have (on average 1.2211538461538463) internal successors, (1016), 834 states have internal predecessors, (1016), 93 states have call successors, (93), 17 states have call predecessors, (93), 17 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 07:17:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1202 transitions. [2024-11-12 07:17:32,901 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1202 transitions. Word has length 142 [2024-11-12 07:17:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:32,904 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1202 transitions. [2024-11-12 07:17:32,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:17:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1202 transitions. [2024-11-12 07:17:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:17:32,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:32,906 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:32,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 07:17:32,906 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -46786852, now seen corresponding path program 1 times [2024-11-12 07:17:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105764413] [2024-11-12 07:17:32,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:17:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999190008] [2024-11-12 07:17:33,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:33,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:17:33,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:17:33,014 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-12 07:17:33,016 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-12 07:17:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:33,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-12 07:17:33,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:17:35,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 07:17:36,416 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 23 treesize of output 11 [2024-11-12 07:17:36,989 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 30 treesize of output 21 [2024-11-12 07:17:37,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-12 07:17:38,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:17:38,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:17:38,543 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 30 treesize of output 21 [2024-11-12 07:17:38,932 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 39 treesize of output 27 [2024-11-12 07:17:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 101 proven. 241 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-12 07:17:39,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:17:39,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:17:39,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105764413] [2024-11-12 07:17:39,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:17:39,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999190008] [2024-11-12 07:17:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999190008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:17:39,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:17:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-11-12 07:17:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214763497] [2024-11-12 07:17:39,788 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 07:17:39,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 07:17:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:17:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 07:17:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-11-12 07:17:39,789 INFO L87 Difference]: Start difference. First operand 943 states and 1202 transitions. Second operand has 19 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 7 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-12 07:17:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:41,453 INFO L93 Difference]: Finished difference Result 2169 states and 2751 transitions. [2024-11-12 07:17:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 07:17:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 7 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 142 [2024-11-12 07:17:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:41,457 INFO L225 Difference]: With dead ends: 2169 [2024-11-12 07:17:41,457 INFO L226 Difference]: Without dead ends: 1258 [2024-11-12 07:17:41,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=399, Invalid=2051, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 07:17:41,459 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 551 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:17:41,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1373 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:17:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-12 07:17:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 799. [2024-11-12 07:17:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 707 states have (on average 1.214992927864215) internal successors, (859), 707 states have internal predecessors, (859), 75 states have call successors, (75), 16 states have call predecessors, (75), 16 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-12 07:17:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1009 transitions. [2024-11-12 07:17:41,517 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1009 transitions. Word has length 142 [2024-11-12 07:17:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1009 transitions. [2024-11-12 07:17:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 7 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-12 07:17:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1009 transitions. [2024-11-12 07:17:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:17:41,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:41,519 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:41,538 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-12 07:17:41,720 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,SelfDestructingSolverStorable33 [2024-11-12 07:17:41,720 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:41,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1744562648, now seen corresponding path program 1 times [2024-11-12 07:17:41,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:17:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318708860] [2024-11-12 07:17:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:17:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:17:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114047177] [2024-11-12 07:17:41,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:17:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:17:41,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:17:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:17:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:17:42,135 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:17:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:17:42,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:17:42,380 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:17:42,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:17:42,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:17:42,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-12 07:17:42,590 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:17:42,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:17:42,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:17:42 BoogieIcfgContainer [2024-11-12 07:17:42,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:17:42,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:17:42,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:17:42,702 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:17:42,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:17:08" (3/4) ... [2024-11-12 07:17:42,704 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:17:42,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:17:42,706 INFO L158 Benchmark]: Toolchain (without parser) took 35463.34ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 93.1MB in the beginning and 1.1GB in the end (delta: -967.6MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,706 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:17:42,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.40ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 131.9MB in the end (delta: -39.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.18ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 127.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,707 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 122.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,707 INFO L158 Benchmark]: RCFGBuilder took 657.95ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 84.8MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,707 INFO L158 Benchmark]: TraceAbstraction took 34280.31ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.7MB in the beginning and 1.1GB in the end (delta: -976.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-12 07:17:42,707 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:17:42,708 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.17ms. Allocated memory is still 167.8MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.40ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 131.9MB in the end (delta: -39.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.18ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 127.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 122.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 657.95ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 84.8MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34280.31ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 83.7MB in the beginning and 1.1GB in the end (delta: -976.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L26-L28] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0][0]); [L30] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1][0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[0][1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[1][1]); [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L33-L35] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0][0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1][0]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[0][1]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[1][1]); [L40-L42] unsigned char unsigned_char_Array_0[1] = { 16 }; [L40-L42] unsigned char unsigned_char_Array_0[1] = { 16 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L44-L46] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L47] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L48] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[2]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=0, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L78] double_Array_0[0][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L79] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L80] double_Array_0[1][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L81] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L82] double_Array_0[0][1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L83] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L86] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L89] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L91] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L92] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L93] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L94] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L95] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L97] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L111] RET updateVariables() [L112] CALL step() [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L53] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L53] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) [L53] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L53] COND FALSE !((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) [L56] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L56] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L59] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L59] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L59] ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L59] COND FALSE !(((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) [L62] (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) = 5 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L64] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L64] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)); [L65] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L65] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)); [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L66] stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L66] COND TRUE stepLocal_0 || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L67] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L67] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L67] COND FALSE !(stepLocal_1 < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1 [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L103] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L103] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) [L103] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L103] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1 [L103] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L103] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) [L103] EXPR ((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L103] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L103] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L103-L104] return ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))) : 1) && ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == 16) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (10 / (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) 5)))) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) < (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) - (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) - 16)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) > (32)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : (32))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))))))) && (((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) <= (256.625 * ((((1.875) > ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) ? (1.875) : ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, isInitial=1, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={8:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 35, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5737 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5722 mSDsluCounter, 30572 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23494 mSDsCounter, 468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5998 IncrementalHoareTripleChecker+Invalid, 6466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 468 mSolverCounterUnsat, 7078 mSDtfsCounter, 5998 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1475 GetRequests, 1224 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1292occurred in iteration=28, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 3800 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 5048 NumberOfCodeBlocks, 5048 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4588 ConstructedInterpolants, 0 QuantifiedInterpolants, 22533 SizeOfPredicates, 16 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 34 InterpolantComputations, 33 PerfectInterpolantSequences, 14039/14280 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-12 07:17:42,767 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-13.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 ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:17:45,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:17:45,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:17:45,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:17:45,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:17:45,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:17:45,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:17:45,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:17:45,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:17:45,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:17:45,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:17:45,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:17:45,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:17:45,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:17:45,425 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:17:45,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:17:45,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:17:45,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:17:45,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:17:45,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:17:45,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:17:45,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:17:45,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:17:45,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:17:45,433 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:17:45,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:17:45,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:17:45,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:17:45,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:17:45,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:17:45,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:17:45,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:17:45,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:17:45,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:17:45,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:17:45,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:17:45,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:17:45,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:17:45,444 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:17:45,444 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:17:45,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:17:45,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:17:45,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:17:45,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:17:45,446 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 -> ab1505ae670373b6c322e0c16a487a3f348c7a8c6cd3865cdae18d40153ca8fc [2024-11-12 07:17:45,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:17:45,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:17:45,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:17:45,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:17:45,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:17:45,743 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-13.i [2024-11-12 07:17:47,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:17:47,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:17:47,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-13.i [2024-11-12 07:17:47,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db30d2d3b/f562a8ebd7e44f5589430ae409deee0b/FLAG90a759af1 [2024-11-12 07:17:47,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db30d2d3b/f562a8ebd7e44f5589430ae409deee0b [2024-11-12 07:17:47,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:17:47,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:17:47,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:17:47,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:17:47,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:17:47,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c58720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47, skipping insertion in model container [2024-11-12 07:17:47,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:17:47,617 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-13.i[917,930] [2024-11-12 07:17:47,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:17:47,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:17:47,717 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-13.i[917,930] [2024-11-12 07:17:47,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:17:47,788 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:17:47,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47 WrapperNode [2024-11-12 07:17:47,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:17:47,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:17:47,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:17:47,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:17:47,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,850 INFO L138 Inliner]: procedures = 33, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2024-11-12 07:17:47,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:17:47,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:17:47,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:17:47,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:17:47,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,885 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2024-11-12 07:17:47,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:17:47,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:17:47,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:17:47,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:17:47,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (1/1) ... [2024-11-12 07:17:47,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:17:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:17:47,966 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-12 07:17:47,972 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-12 07:17:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:17:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:17:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:17:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:17:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:17:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:17:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-12 07:17:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:17:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:17:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:17:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:17:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:17:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:17:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:17:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:17:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:17:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:17:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:17:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:17:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:17:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:17:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:17:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:17:48,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:17:48,176 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:17:48,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:17:58,809 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-12 07:17:58,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:17:58,824 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:17:58,825 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:17:58,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:17:58 BoogieIcfgContainer [2024-11-12 07:17:58,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:17:58,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:17:58,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:17:58,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:17:58,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:17:47" (1/3) ... [2024-11-12 07:17:58,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27321865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:17:58, skipping insertion in model container [2024-11-12 07:17:58,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:17:47" (2/3) ... [2024-11-12 07:17:58,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27321865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:17:58, skipping insertion in model container [2024-11-12 07:17:58,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:17:58" (3/3) ... [2024-11-12 07:17:58,833 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-13.i [2024-11-12 07:17:58,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:17:58,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:17:58,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:17:58,896 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;@169ebe1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:17:58,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:17:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:17:58,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:58,910 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:58,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:58,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:58,915 INFO L85 PathProgramCache]: Analyzing trace with hash 937167592, now seen corresponding path program 1 times [2024-11-12 07:17:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:17:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752903820] [2024-11-12 07:17:58,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:58,928 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-12 07:17:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:17:58,930 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-12 07:17:58,932 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-12 07:17:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:17:59,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:17:59,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:17:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-12 07:17:59,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:17:59,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:17:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752903820] [2024-11-12 07:17:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752903820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:17:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:17:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:17:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140077363] [2024-11-12 07:17:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:17:59,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:17:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:17:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:17:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:17:59,530 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:17:59,557 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-12 07:17:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:17:59,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:17:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:17:59,567 INFO L225 Difference]: With dead ends: 217 [2024-11-12 07:17:59,567 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:17:59,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-12 07:17:59,571 INFO L435 NwaCegarLoop]: 159 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, 159 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-12 07:17:59,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:17:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:17:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:17:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:17:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-12 07:17:59,601 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-12 07:17:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:17:59,602 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-12 07:17:59,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:17:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-12 07:17:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:17:59,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:17:59,605 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:17:59,619 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-12 07:17:59,805 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-12 07:17:59,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:17:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:17:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash 78624018, now seen corresponding path program 1 times [2024-11-12 07:17:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:17:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487666811] [2024-11-12 07:17:59,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:17:59,809 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-12 07:17:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:17:59,812 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-12 07:17:59,814 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-12 07:18:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:00,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:18:00,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-12 07:18:00,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:18:00,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487666811] [2024-11-12 07:18:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487666811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:18:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:18:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:18:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365424779] [2024-11-12 07:18:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:00,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:18:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:18:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:18:00,386 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:18:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:00,561 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2024-11-12 07:18:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:18:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:18:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:00,567 INFO L225 Difference]: With dead ends: 215 [2024-11-12 07:18:00,567 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:18:00,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:18:00,569 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:00,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:18:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:18:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:18:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-12 07:18:00,597 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2024-11-12 07:18:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-12 07:18:00,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:18:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-11-12 07:18:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:18:00,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:00,607 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:00,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:18:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:18:00,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1923262252, now seen corresponding path program 1 times [2024-11-12 07:18:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644384188] [2024-11-12 07:18:00,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:00,810 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-12 07:18:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:00,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:18:00,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:18:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:01,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:18:01,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 07:18:02,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:18:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:18:02,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644384188] [2024-11-12 07:18:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644384188] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:18:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:18:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-12 07:18:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324097202] [2024-11-12 07:18:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:02,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:18:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:18:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:18:02,257 INFO L87 Difference]: Start difference. First operand 110 states and 161 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:02,355 INFO L93 Difference]: Finished difference Result 261 states and 384 transitions. [2024-11-12 07:18:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:18:02,355 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:18:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:02,357 INFO L225 Difference]: With dead ends: 261 [2024-11-12 07:18:02,357 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 07:18:02,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:18:02,358 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 120 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:02,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 453 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:18:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 07:18:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2024-11-12 07:18:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-12 07:18:02,366 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 131 [2024-11-12 07:18:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:02,366 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-12 07:18:02,366 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-12 07:18:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:18:02,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:02,368 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:02,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:18:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:18:02,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1091841366, now seen corresponding path program 1 times [2024-11-12 07:18:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219775248] [2024-11-12 07:18:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:02,570 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-12 07:18:02,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:02,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:18:02,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:18:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:03,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:18:03,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:18:03,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:18:03,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:03,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219775248] [2024-11-12 07:18:03,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219775248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:18:03,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:18:03,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:18:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857485050] [2024-11-12 07:18:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:03,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:18:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:18:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:18:03,086 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:03,121 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2024-11-12 07:18:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:18:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:18:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:03,125 INFO L225 Difference]: With dead ends: 229 [2024-11-12 07:18:03,128 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 07:18:03,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:18:03,130 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:03,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:18:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 07:18:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 07:18:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-12 07:18:03,136 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 131 [2024-11-12 07:18:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-12 07:18:03,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-12 07:18:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:18:03,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:03,138 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:03,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:18:03,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:18:03,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash 617841361, now seen corresponding path program 1 times [2024-11-12 07:18:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554332058] [2024-11-12 07:18:03,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:03,340 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-12 07:18:03,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:03,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:18:03,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:18:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:03,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:18:03,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 07:18:04,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:18:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:18:04,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554332058] [2024-11-12 07:18:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554332058] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:18:04,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:18:04,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-12 07:18:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208523829] [2024-11-12 07:18:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:04,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:18:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:18:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:18:04,292 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:04,366 INFO L93 Difference]: Finished difference Result 268 states and 390 transitions. [2024-11-12 07:18:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:18:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-12 07:18:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:04,368 INFO L225 Difference]: With dead ends: 268 [2024-11-12 07:18:04,368 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 07:18:04,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:18:04,369 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 102 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:04,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 454 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:18:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 07:18:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-11-12 07:18:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2024-11-12 07:18:04,375 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 133 [2024-11-12 07:18:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-12 07:18:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:18:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2024-11-12 07:18:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:18:04,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:04,377 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:04,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:18:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:18:04,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 654298011, now seen corresponding path program 1 times [2024-11-12 07:18:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241946422] [2024-11-12 07:18:04,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:04,580 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-12 07:18:04,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:04,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:18:04,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:18:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:04,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:18:04,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:05,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:18:05,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-12 07:18:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-12 07:18:05,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:18:05,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241946422] [2024-11-12 07:18:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241946422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:18:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:18:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:18:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85932450] [2024-11-12 07:18:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:05,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:18:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:05,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:18:05,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:18:05,144 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:18:08,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:10,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:12,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:15,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:15,102 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2024-11-12 07:18:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:18:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-11-12 07:18:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:15,125 INFO L225 Difference]: With dead ends: 247 [2024-11-12 07:18:15,125 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:18:15,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:18:15,126 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 146 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:15,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 489 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2024-11-12 07:18:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:18:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-12 07:18:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 106 states have internal predecessors, (149), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-11-12 07:18:15,141 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 134 [2024-11-12 07:18:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:15,142 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-11-12 07:18:15,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:18:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-11-12 07:18:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:18:15,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:15,143 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:15,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:18:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 07:18:15,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1341345693, now seen corresponding path program 1 times [2024-11-12 07:18:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:15,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872156144] [2024-11-12 07:18:15,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:15,356 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-12 07:18:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:15,360 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 07:18:15,362 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:18:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:15,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:18:15,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:16,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:18:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 64 [2024-11-12 07:18:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-12 07:18:16,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:18:16,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:18:16,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 1 [2024-11-12 07:18:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 07:18:16,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872156144] [2024-11-12 07:18:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872156144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:18:16,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:18:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-12 07:18:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466302238] [2024-11-12 07:18:16,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:18:16,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:18:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:18:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:18:16,412 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-12 07:18:19,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:21,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:24,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:26,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 07:18:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:18:26,984 INFO L93 Difference]: Finished difference Result 256 states and 370 transitions. [2024-11-12 07:18:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:18:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 136 [2024-11-12 07:18:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:18:27,005 INFO L225 Difference]: With dead ends: 256 [2024-11-12 07:18:27,005 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:18:27,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:18:27,006 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 153 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:18:27,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 738 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-12 07:18:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:18:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-12 07:18:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:18:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2024-11-12 07:18:27,020 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 136 [2024-11-12 07:18:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:18:27,023 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2024-11-12 07:18:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-12 07:18:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2024-11-12 07:18:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:18:27,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:18:27,025 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:18:27,043 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 (8)] Ended with exit code 0 [2024-11-12 07:18:27,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:18:27,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:18:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:18:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -59173407, now seen corresponding path program 1 times [2024-11-12 07:18:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:18:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64501316] [2024-11-12 07:18:27,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:18:27,228 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-12 07:18:27,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:18:27,230 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:18:27,231 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:18:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:18:27,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:18:27,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:18:27,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:18:27,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:18:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 07:18:27,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:18:27,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:18:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64501316] [2024-11-12 07:18:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64501316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:18:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:18:27,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:18:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123125840] [2024-11-12 07:18:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:18:27,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:18:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:18:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:18:27,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:18:27,976 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:18:31,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []