./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:14:12,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:14:12,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:14:12,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:14:12,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:14:12,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:14:12,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:14:12,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:14:12,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:14:12,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:14:12,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:14:12,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:14:12,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:14:12,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:14:12,238 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:14:12,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:14:12,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:14:12,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:14:12,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:14:12,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:14:12,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:14:12,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:14:12,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:14:12,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:14:12,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:14:12,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:14:12,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:14:12,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:14:12,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:14:12,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:14:12,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:14:12,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:14:12,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:12,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:14:12,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:14:12,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:14:12,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:14:12,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:14:12,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:14:12,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:14:12,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:14:12,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:14:12,250 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-10-24 11:14:12,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:14:12,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:14:12,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:14:12,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:14:12,521 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:14:12,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:13,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:14:14,178 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:14:14,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:14,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d2a302f/a34628a4ad0b448bb5f092ee7e41bb35/FLAGd72c50d07 [2024-10-24 11:14:14,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d2a302f/a34628a4ad0b448bb5f092ee7e41bb35 [2024-10-24 11:14:14,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:14:14,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:14:14,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:14,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:14:14,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:14:14,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bde0a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14, skipping insertion in model container [2024-10-24 11:14:14,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:14:14,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-10-24 11:14:14,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:14,485 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:14:14,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-10-24 11:14:14,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:14,554 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:14:14,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14 WrapperNode [2024-10-24 11:14:14,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:14,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:14,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:14:14,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:14:14,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,617 INFO L138 Inliner]: procedures = 29, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-10-24 11:14:14,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:14,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:14:14,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:14:14,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:14:14,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,680 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-10-24 11:14:14,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:14:14,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:14:14,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:14:14,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:14:14,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (1/1) ... [2024-10-24 11:14:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:14,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:14:14,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:14:14,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:14:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:14:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:14:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:14:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:14:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:14:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:14:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:14:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:14:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:14:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:14:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:14:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:14:14,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:14:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:14:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:14:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:14:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:14:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:14:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:14:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:14:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:14:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:14:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:14:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:14:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:14:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:14:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:14:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:14:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:14:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:14:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:14:15,025 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:14:15,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:14:15,575 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-24 11:14:15,576 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:14:15,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:14:15,630 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:14:15,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:15 BoogieIcfgContainer [2024-10-24 11:14:15,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:14:15,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:14:15,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:14:15,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:14:15,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:14:14" (1/3) ... [2024-10-24 11:14:15,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a12635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:15, skipping insertion in model container [2024-10-24 11:14:15,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:14" (2/3) ... [2024-10-24 11:14:15,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a12635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:15, skipping insertion in model container [2024-10-24 11:14:15,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:15" (3/3) ... [2024-10-24 11:14:15,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:15,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:14:15,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:14:15,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:14:15,719 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;@1b14ae59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:14:15,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:14:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:14:15,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:15,739 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:15,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash -46958772, now seen corresponding path program 1 times [2024-10-24 11:14:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:15,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607193521] [2024-10-24 11:14:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607193521] [2024-10-24 11:14:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607193521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:14:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783645398] [2024-10-24 11:14:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:14:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:14:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:14:16,142 INFO L87 Difference]: Start difference. First operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:16,186 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-10-24 11:14:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:14:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-24 11:14:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:16,196 INFO L225 Difference]: With dead ends: 193 [2024-10-24 11:14:16,196 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:14:16,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:14:16,205 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:16,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:14:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-24 11:14:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-10-24 11:14:16,250 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 85 [2024-10-24 11:14:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:16,250 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-10-24 11:14:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-10-24 11:14:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:14:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:16,255 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:14:16,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:16,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1455149370, now seen corresponding path program 1 times [2024-10-24 11:14:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849175489] [2024-10-24 11:14:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849175489] [2024-10-24 11:14:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849175489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:14:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523596757] [2024-10-24 11:14:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:14:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:16,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:14:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:16,592 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:16,652 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2024-10-24 11:14:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:14:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-24 11:14:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:16,654 INFO L225 Difference]: With dead ends: 193 [2024-10-24 11:14:16,655 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:14:16,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:16,657 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:16,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:14:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 11:14:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-10-24 11:14:16,676 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 85 [2024-10-24 11:14:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-10-24 11:14:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-10-24 11:14:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:14:16,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:16,682 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:16,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:14:16,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -487798716, now seen corresponding path program 1 times [2024-10-24 11:14:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170085680] [2024-10-24 11:14:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170085680] [2024-10-24 11:14:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170085680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:14:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206353865] [2024-10-24 11:14:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:14:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:17,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:14:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:17,467 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:18,488 INFO L93 Difference]: Finished difference Result 518 states and 753 transitions. [2024-10-24 11:14:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:14:18,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2024-10-24 11:14:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:18,493 INFO L225 Difference]: With dead ends: 518 [2024-10-24 11:14:18,494 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 11:14:18,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:14:18,496 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 568 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:18,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 894 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:14:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 11:14:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 277. [2024-10-24 11:14:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 246 states have (on average 1.4268292682926829) internal successors, (351), 246 states have internal predecessors, (351), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2024-10-24 11:14:18,539 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 85 [2024-10-24 11:14:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:18,539 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2024-10-24 11:14:18,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2024-10-24 11:14:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:14:18,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:18,542 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:18,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:14:18,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1668882504, now seen corresponding path program 1 times [2024-10-24 11:14:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063003220] [2024-10-24 11:14:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063003220] [2024-10-24 11:14:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063003220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:14:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038140178] [2024-10-24 11:14:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:14:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:14:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:18,750 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:18,846 INFO L93 Difference]: Finished difference Result 665 states and 973 transitions. [2024-10-24 11:14:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:14:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-24 11:14:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:18,849 INFO L225 Difference]: With dead ends: 665 [2024-10-24 11:14:18,850 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 11:14:18,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:18,856 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 134 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:18,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 441 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 11:14:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 196. [2024-10-24 11:14:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-10-24 11:14:18,898 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 86 [2024-10-24 11:14:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:18,898 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-10-24 11:14:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-10-24 11:14:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:14:18,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:18,902 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:14:18,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 645267233, now seen corresponding path program 1 times [2024-10-24 11:14:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229853657] [2024-10-24 11:14:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:19,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229853657] [2024-10-24 11:14:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229853657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:19,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:14:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156884490] [2024-10-24 11:14:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:19,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:14:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:14:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:19,054 INFO L87 Difference]: Start difference. First operand 196 states and 284 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:19,116 INFO L93 Difference]: Finished difference Result 353 states and 510 transitions. [2024-10-24 11:14:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:14:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-24 11:14:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:19,119 INFO L225 Difference]: With dead ends: 353 [2024-10-24 11:14:19,119 INFO L226 Difference]: Without dead ends: 158 [2024-10-24 11:14:19,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:19,120 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:19,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-24 11:14:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2024-10-24 11:14:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 206 transitions. [2024-10-24 11:14:19,134 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 206 transitions. Word has length 87 [2024-10-24 11:14:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:19,136 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 206 transitions. [2024-10-24 11:14:19,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 206 transitions. [2024-10-24 11:14:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:14:19,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:19,141 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:14:19,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:19,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1701151513, now seen corresponding path program 1 times [2024-10-24 11:14:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431720947] [2024-10-24 11:14:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:14:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431720947] [2024-10-24 11:14:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431720947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555717877] [2024-10-24 11:14:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:14:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:14:19,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:14:19,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:14:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:20,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:14:20,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:20,480 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 13 treesize of output 11 [2024-10-24 11:14:20,530 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 21 treesize of output 15 [2024-10-24 11:14:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:14:20,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555717877] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:14:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 20 [2024-10-24 11:14:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559829128] [2024-10-24 11:14:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:14:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:14:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:14:21,012 INFO L87 Difference]: Start difference. First operand 144 states and 206 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:21,219 INFO L93 Difference]: Finished difference Result 338 states and 483 transitions. [2024-10-24 11:14:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:14:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-24 11:14:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:21,223 INFO L225 Difference]: With dead ends: 338 [2024-10-24 11:14:21,224 INFO L226 Difference]: Without dead ends: 242 [2024-10-24 11:14:21,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:14:21,226 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 118 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:21,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 700 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-24 11:14:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2024-10-24 11:14:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 143 states have internal predecessors, (197), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2024-10-24 11:14:21,245 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 90 [2024-10-24 11:14:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:21,246 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2024-10-24 11:14:21,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2024-10-24 11:14:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:14:21,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:21,248 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:21,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:21,451 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,SelfDestructingSolverStorable5 [2024-10-24 11:14:21,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash 978758231, now seen corresponding path program 1 times [2024-10-24 11:14:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751424577] [2024-10-24 11:14:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751424577] [2024-10-24 11:14:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751424577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:22,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:14:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927866103] [2024-10-24 11:14:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:22,015 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:22,244 INFO L93 Difference]: Finished difference Result 375 states and 536 transitions. [2024-10-24 11:14:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:14:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:14:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:22,246 INFO L225 Difference]: With dead ends: 375 [2024-10-24 11:14:22,247 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 11:14:22,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:14:22,248 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 204 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:22,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 596 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:14:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 11:14:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-10-24 11:14:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 225 states have (on average 1.3866666666666667) internal successors, (312), 225 states have internal predecessors, (312), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions. [2024-10-24 11:14:22,275 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 91 [2024-10-24 11:14:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:22,276 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 366 transitions. [2024-10-24 11:14:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions. [2024-10-24 11:14:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:22,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:22,278 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:14:22,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:22,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash -380037044, now seen corresponding path program 1 times [2024-10-24 11:14:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:22,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855112079] [2024-10-24 11:14:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855112079] [2024-10-24 11:14:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855112079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:22,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:22,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:14:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421093959] [2024-10-24 11:14:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:22,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:14:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:14:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:14:22,973 INFO L87 Difference]: Start difference. First operand 256 states and 366 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:23,282 INFO L93 Difference]: Finished difference Result 426 states and 606 transitions. [2024-10-24 11:14:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:14:23,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-24 11:14:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:23,284 INFO L225 Difference]: With dead ends: 426 [2024-10-24 11:14:23,285 INFO L226 Difference]: Without dead ends: 313 [2024-10-24 11:14:23,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:14:23,286 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 163 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:23,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1177 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:14:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-24 11:14:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 281. [2024-10-24 11:14:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2024-10-24 11:14:23,307 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 92 [2024-10-24 11:14:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:23,307 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2024-10-24 11:14:23,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2024-10-24 11:14:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:23,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:23,309 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:23,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:14:23,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:23,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 202947745, now seen corresponding path program 1 times [2024-10-24 11:14:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:23,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382847568] [2024-10-24 11:14:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382847568] [2024-10-24 11:14:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382847568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:23,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:23,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:14:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123949672] [2024-10-24 11:14:23,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:23,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:14:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:14:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:23,852 INFO L87 Difference]: Start difference. First operand 281 states and 401 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:24,133 INFO L93 Difference]: Finished difference Result 473 states and 672 transitions. [2024-10-24 11:14:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:14:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-24 11:14:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:24,137 INFO L225 Difference]: With dead ends: 473 [2024-10-24 11:14:24,137 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 11:14:24,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:14:24,138 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 315 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:24,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 826 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:14:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 11:14:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 277. [2024-10-24 11:14:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 246 states have internal predecessors, (340), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 394 transitions. [2024-10-24 11:14:24,162 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 394 transitions. Word has length 92 [2024-10-24 11:14:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:24,162 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 394 transitions. [2024-10-24 11:14:24,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 394 transitions. [2024-10-24 11:14:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:24,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:24,163 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:24,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:14:24,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:24,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2019095251, now seen corresponding path program 1 times [2024-10-24 11:14:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435989860] [2024-10-24 11:14:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435989860] [2024-10-24 11:14:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435989860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:14:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111285433] [2024-10-24 11:14:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:24,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:14:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:24,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:14:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:24,481 INFO L87 Difference]: Start difference. First operand 277 states and 394 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:24,963 INFO L93 Difference]: Finished difference Result 762 states and 1088 transitions. [2024-10-24 11:14:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:14:24,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-24 11:14:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:24,967 INFO L225 Difference]: With dead ends: 762 [2024-10-24 11:14:24,967 INFO L226 Difference]: Without dead ends: 532 [2024-10-24 11:14:24,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:14:24,968 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 237 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:24,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 625 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:14:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-24 11:14:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 292. [2024-10-24 11:14:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 261 states have (on average 1.371647509578544) internal successors, (358), 261 states have internal predecessors, (358), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2024-10-24 11:14:24,999 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 92 [2024-10-24 11:14:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:24,999 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2024-10-24 11:14:24,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2024-10-24 11:14:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:25,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:25,001 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:14:25,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1878546641, now seen corresponding path program 1 times [2024-10-24 11:14:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945801359] [2024-10-24 11:14:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945801359] [2024-10-24 11:14:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945801359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:14:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402085212] [2024-10-24 11:14:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:25,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:14:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:14:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:14:25,812 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:26,824 INFO L93 Difference]: Finished difference Result 696 states and 985 transitions. [2024-10-24 11:14:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:14:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-24 11:14:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:26,827 INFO L225 Difference]: With dead ends: 696 [2024-10-24 11:14:26,828 INFO L226 Difference]: Without dead ends: 583 [2024-10-24 11:14:26,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:14:26,830 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 488 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:26,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1082 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:14:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-24 11:14:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 308. [2024-10-24 11:14:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 277 states have (on average 1.3754512635379061) internal successors, (381), 277 states have internal predecessors, (381), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 435 transitions. [2024-10-24 11:14:26,880 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 435 transitions. Word has length 92 [2024-10-24 11:14:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:26,881 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 435 transitions. [2024-10-24 11:14:26,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 435 transitions. [2024-10-24 11:14:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:26,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:26,882 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:26,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:14:26,882 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1620381203, now seen corresponding path program 1 times [2024-10-24 11:14:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569357977] [2024-10-24 11:14:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569357977] [2024-10-24 11:14:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569357977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:14:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064969269] [2024-10-24 11:14:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:27,205 INFO L87 Difference]: Start difference. First operand 308 states and 435 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:27,286 INFO L93 Difference]: Finished difference Result 491 states and 697 transitions. [2024-10-24 11:14:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:14:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-10-24 11:14:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:27,288 INFO L225 Difference]: With dead ends: 491 [2024-10-24 11:14:27,288 INFO L226 Difference]: Without dead ends: 363 [2024-10-24 11:14:27,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:14:27,289 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 74 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:27,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 722 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-24 11:14:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 292. [2024-10-24 11:14:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 261 states have (on average 1.367816091954023) internal successors, (357), 261 states have internal predecessors, (357), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2024-10-24 11:14:27,318 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 92 [2024-10-24 11:14:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:27,319 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2024-10-24 11:14:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2024-10-24 11:14:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 11:14:27,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:27,320 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:14:27,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1455844815, now seen corresponding path program 1 times [2024-10-24 11:14:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134245210] [2024-10-24 11:14:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134245210] [2024-10-24 11:14:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134245210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:14:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014415137] [2024-10-24 11:14:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:14:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:14:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:14:27,981 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:28,741 INFO L93 Difference]: Finished difference Result 677 states and 955 transitions. [2024-10-24 11:14:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:14:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-10-24 11:14:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:28,745 INFO L225 Difference]: With dead ends: 677 [2024-10-24 11:14:28,745 INFO L226 Difference]: Without dead ends: 444 [2024-10-24 11:14:28,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:14:28,747 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 291 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:28,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 727 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:14:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-24 11:14:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 300. [2024-10-24 11:14:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 269 states have internal predecessors, (366), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 420 transitions. [2024-10-24 11:14:28,786 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 420 transitions. Word has length 92 [2024-10-24 11:14:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:28,786 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 420 transitions. [2024-10-24 11:14:28,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 420 transitions. [2024-10-24 11:14:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:14:28,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:28,788 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:28,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:14:28,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1512746447, now seen corresponding path program 1 times [2024-10-24 11:14:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032764356] [2024-10-24 11:14:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032764356] [2024-10-24 11:14:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032764356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:28,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:14:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937361563] [2024-10-24 11:14:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:14:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:14:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:28,994 INFO L87 Difference]: Start difference. First operand 300 states and 420 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:29,024 INFO L93 Difference]: Finished difference Result 417 states and 584 transitions. [2024-10-24 11:14:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:14:29,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-10-24 11:14:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:29,026 INFO L225 Difference]: With dead ends: 417 [2024-10-24 11:14:29,026 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 11:14:29,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:29,028 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:29,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 11:14:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-10-24 11:14:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 154 states have internal predecessors, (203), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2024-10-24 11:14:29,048 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 93 [2024-10-24 11:14:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:29,049 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2024-10-24 11:14:29,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2024-10-24 11:14:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:14:29,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:29,051 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:29,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:14:29,052 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1149046449, now seen corresponding path program 1 times [2024-10-24 11:14:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964868708] [2024-10-24 11:14:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:14:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:14:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:14:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:14:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:14:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:14:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:14:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:14:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:14:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:14:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:14:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964868708] [2024-10-24 11:14:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964868708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346679794] [2024-10-24 11:14:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:14:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:14:29,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:14:29,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:14:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:30,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 11:14:30,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:30,154 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 9 treesize of output 3 [2024-10-24 11:14:30,755 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 13 treesize of output 11 [2024-10-24 11:14:31,045 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 26 treesize of output 14 [2024-10-24 11:14:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-24 11:14:31,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:32,574 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 60 treesize of output 44 [2024-10-24 11:14:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-24 11:14:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346679794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:14:33,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:14:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 17] total 40 [2024-10-24 11:14:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128430061] [2024-10-24 11:14:33,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:14:33,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 11:14:33,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:14:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 11:14:33,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 11:14:33,021 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 40 states, 35 states have (on average 3.857142857142857) internal successors, (135), 38 states have internal predecessors, (135), 11 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 8 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 11:14:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:35,567 INFO L93 Difference]: Finished difference Result 427 states and 583 transitions. [2024-10-24 11:14:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-24 11:14:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 3.857142857142857) internal successors, (135), 38 states have internal predecessors, (135), 11 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 8 states have call predecessors, (27), 11 states have call successors, (27) Word has length 94 [2024-10-24 11:14:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:35,569 INFO L225 Difference]: With dead ends: 427 [2024-10-24 11:14:35,570 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 11:14:35,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1030, Invalid=3662, Unknown=0, NotChecked=0, Total=4692 [2024-10-24 11:14:35,572 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 579 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:35,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1805 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:14:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 11:14:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 189. [2024-10-24 11:14:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2024-10-24 11:14:35,600 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 94 [2024-10-24 11:14:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:35,601 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2024-10-24 11:14:35,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 3.857142857142857) internal successors, (135), 38 states have internal predecessors, (135), 11 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 8 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-24 11:14:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2024-10-24 11:14:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:14:35,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:35,602 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:35,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:14:35,803 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,SelfDestructingSolverStorable14 [2024-10-24 11:14:35,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:35,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 262583596, now seen corresponding path program 1 times [2024-10-24 11:14:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:14:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740586249] [2024-10-24 11:14:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:14:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:14:35,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:14:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:14:35,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:14:35,997 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:14:35,998 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:14:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:14:36,005 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:36,100 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:14:36,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:14:36 BoogieIcfgContainer [2024-10-24 11:14:36,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:14:36,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:14:36,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:14:36,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:14:36,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:15" (3/4) ... [2024-10-24 11:14:36,107 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:14:36,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:14:36,108 INFO L158 Benchmark]: Toolchain (without parser) took 21903.63ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 119.2MB in the beginning and 340.0MB in the end (delta: -220.8MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,109 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:14:36,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.72ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 102.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.53ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 99.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,110 INFO L158 Benchmark]: Boogie Preprocessor took 131.08ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 94.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,111 INFO L158 Benchmark]: RCFGBuilder took 880.05ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 94.1MB in the beginning and 193.3MB in the end (delta: -99.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,111 INFO L158 Benchmark]: TraceAbstraction took 20469.77ms. Allocated memory was 228.6MB in the beginning and 478.2MB in the end (delta: 249.6MB). Free memory was 192.2MB in the beginning and 340.0MB in the end (delta: -147.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-10-24 11:14:36,111 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 478.2MB. Free memory is still 340.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:14:36,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.72ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 102.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.53ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 99.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.08ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 94.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 880.05ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 94.1MB in the beginning and 193.3MB in the end (delta: -99.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20469.77ms. Allocated memory was 228.6MB in the beginning and 478.2MB in the end (delta: 249.6MB). Free memory was 192.2MB in the beginning and 340.0MB in the end (delta: -147.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 478.2MB. Free memory is still 340.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of bitwiseAnd at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -5; [L38] unsigned long int last_1_unsigned_long_int_Array_0_1_ = 8; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L88] EXPR signed_short_int_Array_0[0] [L88] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L89] EXPR unsigned_long_int_Array_0[1] [L89] last_1_unsigned_long_int_Array_0_1_ = unsigned_long_int_Array_0[1] [L99] RET updateLastVariables() [L100] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] float_Array_0[0][0] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] RET updateVariables() [L101] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0] [L44] unsigned_short_int_Array_0[1] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] EXPR unsigned_short_int_Array_0[1] [L50] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND TRUE unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] + -16) [L57] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND TRUE last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] unsigned_long_int_Array_0[1] = ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))) [L66] EXPR signed_short_int_Array_0[0] [L66] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1] [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[0][0] [L67] EXPR float_Array_0[0][1] [L67] float_Array_0[1][1] = (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] [L92] EXPR float_Array_0[0][1] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92-L93] return ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3172 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3171 mSDsluCounter, 10619 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8166 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5534 IncrementalHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 2453 mSDtfsCounter, 5534 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=11, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1400 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1628 NumberOfCodeBlocks, 1628 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1697 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710 SizeOfPredicates, 21 NumberOfNonLiveVariables, 716 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 2670/2736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:14:36,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:14:38,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:14:38,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:14:38,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:14:38,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:14:38,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:14:38,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:14:38,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:14:38,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:14:38,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:14:38,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:14:38,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:14:38,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:14:38,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:14:38,656 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:14:38,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:14:38,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:14:38,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:14:38,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:14:38,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:14:38,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:14:38,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:14:38,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:14:38,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:14:38,665 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:14:38,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:14:38,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:14:38,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:14:38,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:14:38,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:14:38,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:14:38,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:14:38,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:14:38,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:14:38,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:38,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:14:38,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:14:38,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:14:38,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:14:38,670 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:14:38,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:14:38,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:14:38,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:14:38,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:14:38,672 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:14:38,672 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2024-10-24 11:14:39,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:14:39,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:14:39,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:14:39,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:14:39,044 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:14:39,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:40,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:14:40,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:14:40,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:40,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21089e7fd/ec4142190fae47b1871d3851242abe16/FLAG3ca6fa119 [2024-10-24 11:14:40,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21089e7fd/ec4142190fae47b1871d3851242abe16 [2024-10-24 11:14:40,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:14:40,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:14:40,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:40,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:14:40,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:14:40,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:40" (1/1) ... [2024-10-24 11:14:40,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d51e13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:40, skipping insertion in model container [2024-10-24 11:14:40,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:40" (1/1) ... [2024-10-24 11:14:41,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:14:41,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-10-24 11:14:41,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:41,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:14:41,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i[916,929] [2024-10-24 11:14:41,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:14:41,435 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:14:41,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41 WrapperNode [2024-10-24 11:14:41,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:14:41,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:41,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:14:41,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:14:41,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,520 INFO L138 Inliner]: procedures = 36, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2024-10-24 11:14:41,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:14:41,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:14:41,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:14:41,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:14:41,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,583 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2024-10-24 11:14:41,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:14:41,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:14:41,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:14:41,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:14:41,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (1/1) ... [2024-10-24 11:14:41,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:14:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:14:41,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:14:41,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:14:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:14:41,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:14:41,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:14:41,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:14:41,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:14:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:14:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:14:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:14:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:14:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:14:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 11:14:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 11:14:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 11:14:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:14:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:14:41,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:14:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:14:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:14:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 11:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 11:14:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 11:14:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 11:14:41,908 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:14:41,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:14:43,646 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-24 11:14:43,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:14:43,723 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:14:43,724 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:14:43,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:43 BoogieIcfgContainer [2024-10-24 11:14:43,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:14:43,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:14:43,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:14:43,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:14:43,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:14:40" (1/3) ... [2024-10-24 11:14:43,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64696e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:43, skipping insertion in model container [2024-10-24 11:14:43,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:41" (2/3) ... [2024-10-24 11:14:43,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64696e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:43, skipping insertion in model container [2024-10-24 11:14:43,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:43" (3/3) ... [2024-10-24 11:14:43,735 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2024-10-24 11:14:43,751 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:14:43,751 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:14:43,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:14:43,804 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;@43b3ff93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:14:43,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:14:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:14:43,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:43,817 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:43,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:43,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1836649689, now seen corresponding path program 1 times [2024-10-24 11:14:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680361746] [2024-10-24 11:14:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:43,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:43,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:43,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:14:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:44,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:14:44,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-24 11:14:44,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:44,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680361746] [2024-10-24 11:14:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680361746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:14:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053790858] [2024-10-24 11:14:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:44,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:14:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:14:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:14:44,331 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:44,397 INFO L93 Difference]: Finished difference Result 178 states and 276 transitions. [2024-10-24 11:14:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:14:44,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:14:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:44,417 INFO L225 Difference]: With dead ends: 178 [2024-10-24 11:14:44,417 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 11:14:44,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:14:44,425 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:44,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 11:14:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 11:14:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-10-24 11:14:44,466 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 84 [2024-10-24 11:14:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:44,467 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-10-24 11:14:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-10-24 11:14:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:14:44,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:44,472 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:44,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:14:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:44,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2138696593, now seen corresponding path program 1 times [2024-10-24 11:14:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586600977] [2024-10-24 11:14:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:44,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:14:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:45,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:14:45,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:14:45,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:45,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:45,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586600977] [2024-10-24 11:14:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586600977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:45,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:45,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:14:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133553008] [2024-10-24 11:14:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:45,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:14:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:14:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:45,134 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:45,213 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2024-10-24 11:14:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:14:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2024-10-24 11:14:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:45,215 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:14:45,216 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:14:45,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:14:45,219 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:45,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:14:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:14:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 11:14:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:14:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-24 11:14:45,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 87 [2024-10-24 11:14:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:45,236 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-24 11:14:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:14:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-24 11:14:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:14:45,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:45,242 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:45,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:14:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:45,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:45,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash -245228145, now seen corresponding path program 1 times [2024-10-24 11:14:45,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789866416] [2024-10-24 11:14:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:45,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:45,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:45,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:45,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:14:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:45,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:14:45,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:46,476 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 19 treesize of output 15 [2024-10-24 11:14:46,571 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 47 treesize of output 35 [2024-10-24 11:14:46,720 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 84 treesize of output 60 [2024-10-24 11:14:46,727 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 63 treesize of output 51 [2024-10-24 11:14:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:46,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:46,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:46,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789866416] [2024-10-24 11:14:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789866416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:14:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393047808] [2024-10-24 11:14:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:14:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:14:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:14:46,771 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:47,925 INFO L93 Difference]: Finished difference Result 485 states and 686 transitions. [2024-10-24 11:14:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:14:47,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-24 11:14:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:47,933 INFO L225 Difference]: With dead ends: 485 [2024-10-24 11:14:47,934 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 11:14:47,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:14:47,936 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 407 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:47,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1337 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:14:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 11:14:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 345. [2024-10-24 11:14:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 304 states have (on average 1.388157894736842) internal successors, (422), 304 states have internal predecessors, (422), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:14:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 494 transitions. [2024-10-24 11:14:47,988 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 494 transitions. Word has length 87 [2024-10-24 11:14:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:47,989 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 494 transitions. [2024-10-24 11:14:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 494 transitions. [2024-10-24 11:14:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 11:14:47,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:47,991 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:48,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:14:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:48,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -41960913, now seen corresponding path program 1 times [2024-10-24 11:14:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223338536] [2024-10-24 11:14:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:48,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:48,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:48,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:48,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:14:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:48,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:14:48,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:48,523 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 17 treesize of output 9 [2024-10-24 11:14:48,680 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 16 treesize of output 12 [2024-10-24 11:14:48,705 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 33 treesize of output 15 [2024-10-24 11:14:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:48,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:48,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223338536] [2024-10-24 11:14:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223338536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:48,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284367013] [2024-10-24 11:14:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:48,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:48,731 INFO L87 Difference]: Start difference. First operand 345 states and 494 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:49,305 INFO L93 Difference]: Finished difference Result 698 states and 988 transitions. [2024-10-24 11:14:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:14:49,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-10-24 11:14:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:49,309 INFO L225 Difference]: With dead ends: 698 [2024-10-24 11:14:49,309 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 11:14:49,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:14:49,315 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 395 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:49,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 958 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:14:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 11:14:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 260. [2024-10-24 11:14:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 229 states have internal predecessors, (316), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 370 transitions. [2024-10-24 11:14:49,350 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 370 transitions. Word has length 88 [2024-10-24 11:14:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:49,351 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 370 transitions. [2024-10-24 11:14:49,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 370 transitions. [2024-10-24 11:14:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 11:14:49,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:49,353 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:49,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:49,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:49,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:49,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1078887405, now seen corresponding path program 1 times [2024-10-24 11:14:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066948055] [2024-10-24 11:14:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:49,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:49,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:49,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:49,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:14:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:49,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:14:49,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:49,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:49,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066948055] [2024-10-24 11:14:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066948055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:14:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073099443] [2024-10-24 11:14:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:14:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:14:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:49,869 INFO L87 Difference]: Start difference. First operand 260 states and 370 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:49,916 INFO L93 Difference]: Finished difference Result 533 states and 759 transitions. [2024-10-24 11:14:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:14:49,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2024-10-24 11:14:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:49,919 INFO L225 Difference]: With dead ends: 533 [2024-10-24 11:14:49,919 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 11:14:49,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:14:49,921 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:49,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:14:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 11:14:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-10-24 11:14:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.3705882352941177) internal successors, (233), 170 states have internal predecessors, (233), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 269 transitions. [2024-10-24 11:14:49,937 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 269 transitions. Word has length 88 [2024-10-24 11:14:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:49,937 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 269 transitions. [2024-10-24 11:14:49,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 269 transitions. [2024-10-24 11:14:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 11:14:49,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:49,939 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:49,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:14:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:50,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:50,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1042387596, now seen corresponding path program 1 times [2024-10-24 11:14:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008669432] [2024-10-24 11:14:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:50,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:50,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:14:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:50,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:14:50,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:50,521 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 17 treesize of output 9 [2024-10-24 11:14:50,658 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 14 treesize of output 10 [2024-10-24 11:14:50,775 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 51 treesize of output 33 [2024-10-24 11:14:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:50,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:50,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008669432] [2024-10-24 11:14:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008669432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:14:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587125544] [2024-10-24 11:14:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:14:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:14:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:14:50,807 INFO L87 Difference]: Start difference. First operand 191 states and 269 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:51,341 INFO L93 Difference]: Finished difference Result 356 states and 495 transitions. [2024-10-24 11:14:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:14:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-10-24 11:14:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:51,343 INFO L225 Difference]: With dead ends: 356 [2024-10-24 11:14:51,344 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 11:14:51,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:14:51,345 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 231 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:51,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 874 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:14:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 11:14:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 199. [2024-10-24 11:14:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 178 states have internal predecessors, (244), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions. [2024-10-24 11:14:51,361 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 89 [2024-10-24 11:14:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:51,362 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 280 transitions. [2024-10-24 11:14:51,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions. [2024-10-24 11:14:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 11:14:51,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:51,366 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:51,379 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 (7)] Ended with exit code 0 [2024-10-24 11:14:51,566 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-10-24 11:14:51,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -459402807, now seen corresponding path program 1 times [2024-10-24 11:14:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954554423] [2024-10-24 11:14:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:51,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:51,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:51,569 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-10-24 11:14:51,570 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-10-24 11:14:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:51,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:14:51,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:51,886 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 17 treesize of output 9 [2024-10-24 11:14:52,018 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 16 treesize of output 12 [2024-10-24 11:14:52,065 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 33 treesize of output 15 [2024-10-24 11:14:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:52,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:52,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954554423] [2024-10-24 11:14:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954554423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:14:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:14:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873719684] [2024-10-24 11:14:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:14:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:14:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:14:52,084 INFO L87 Difference]: Start difference. First operand 199 states and 280 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:52,532 INFO L93 Difference]: Finished difference Result 403 states and 561 transitions. [2024-10-24 11:14:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:14:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-10-24 11:14:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:52,535 INFO L225 Difference]: With dead ends: 403 [2024-10-24 11:14:52,536 INFO L226 Difference]: Without dead ends: 307 [2024-10-24 11:14:52,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:14:52,537 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 319 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:52,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 901 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:14:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-24 11:14:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 195. [2024-10-24 11:14:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2024-10-24 11:14:52,550 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 89 [2024-10-24 11:14:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:52,550 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2024-10-24 11:14:52,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2024-10-24 11:14:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:14:52,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:52,552 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:52,566 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-10-24 11:14:52,752 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-10-24 11:14:52,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 9853112, now seen corresponding path program 1 times [2024-10-24 11:14:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100021753] [2024-10-24 11:14:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:52,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:52,755 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-10-24 11:14:52,756 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-10-24 11:14:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:53,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:14:53,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:53,295 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 18 treesize of output 10 [2024-10-24 11:14:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:14:53,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:53,572 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 23 treesize of output 15 [2024-10-24 11:14:53,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100021753] [2024-10-24 11:14:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100021753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [9002389] [2024-10-24 11:14:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:53,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:14:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:14:53,638 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:14:53,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-24 11:14:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:54,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:14:54,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:54,575 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 14 treesize of output 10 [2024-10-24 11:14:54,624 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 23 treesize of output 19 [2024-10-24 11:14:54,764 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 82 treesize of output 58 [2024-10-24 11:14:54,769 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 57 treesize of output 45 [2024-10-24 11:14:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:54,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:14:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [9002389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:14:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:14:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2024-10-24 11:14:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229120692] [2024-10-24 11:14:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:14:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:54,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:14:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:14:54,840 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:55,796 INFO L93 Difference]: Finished difference Result 691 states and 968 transitions. [2024-10-24 11:14:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:14:55,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-24 11:14:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:55,802 INFO L225 Difference]: With dead ends: 691 [2024-10-24 11:14:55,802 INFO L226 Difference]: Without dead ends: 603 [2024-10-24 11:14:55,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:14:55,805 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 394 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:55,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1529 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:14:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-24 11:14:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 255. [2024-10-24 11:14:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 224 states have internal predecessors, (304), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:14:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2024-10-24 11:14:55,828 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 90 [2024-10-24 11:14:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:55,828 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2024-10-24 11:14:55,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2024-10-24 11:14:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 11:14:55,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:55,830 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:55,842 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:56,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:14:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:14:56,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:14:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:14:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1795585222, now seen corresponding path program 1 times [2024-10-24 11:14:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:14:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634812205] [2024-10-24 11:14:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:56,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:14:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:14:56,233 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:14:56,234 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 (11)] Waiting until timeout for monitored process [2024-10-24 11:14:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:56,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:14:56,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:56,525 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 9 treesize of output 3 [2024-10-24 11:14:56,829 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 15 treesize of output 7 [2024-10-24 11:14:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 11:14:56,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:57,551 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-10-24 11:14:57,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:14:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634812205] [2024-10-24 11:14:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634812205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [703278108] [2024-10-24 11:14:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:14:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:14:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:14:57,614 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:14:57,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-24 11:14:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:14:58,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:14:58,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:14:58,904 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 31 treesize of output 26 [2024-10-24 11:14:58,991 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 21 treesize of output 17 [2024-10-24 11:14:59,192 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 66 treesize of output 54 [2024-10-24 11:14:59,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:14:59,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 59 [2024-10-24 11:14:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-24 11:14:59,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:14:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:14:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [703278108] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:14:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:14:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 11] total 22 [2024-10-24 11:14:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261330429] [2024-10-24 11:14:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:14:59,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:14:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:14:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:14:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-10-24 11:14:59,455 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:14:59,831 INFO L93 Difference]: Finished difference Result 430 states and 604 transitions. [2024-10-24 11:14:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:14:59,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-24 11:14:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:14:59,834 INFO L225 Difference]: With dead ends: 430 [2024-10-24 11:14:59,834 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 11:14:59,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:14:59,836 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 107 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:14:59,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 549 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:14:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 11:14:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 209. [2024-10-24 11:14:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 188 states have (on average 1.3617021276595744) internal successors, (256), 188 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 11:14:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2024-10-24 11:14:59,852 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 90 [2024-10-24 11:14:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:14:59,853 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2024-10-24 11:14:59,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:14:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2024-10-24 11:14:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:14:59,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:14:59,854 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:14:59,867 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 (11)] Ended with exit code 0 [2024-10-24 11:15:00,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-24 11:15:00,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:00,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:00,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1880002853, now seen corresponding path program 1 times [2024-10-24 11:15:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842930291] [2024-10-24 11:15:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:00,258 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:00,259 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 (13)] Waiting until timeout for monitored process [2024-10-24 11:15:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:00,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:15:00,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:00,864 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 19 treesize of output 15 [2024-10-24 11:15:00,901 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-10-24 11:15:00,909 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 32 treesize of output 20 [2024-10-24 11:15:00,972 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 25 treesize of output 17 [2024-10-24 11:15:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:15:00,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:15:00,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842930291] [2024-10-24 11:15:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842930291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517587269] [2024-10-24 11:15:00,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:15:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:00,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:15:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:00,990 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:15:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:02,021 INFO L93 Difference]: Finished difference Result 401 states and 560 transitions. [2024-10-24 11:15:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:02,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:15:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:02,024 INFO L225 Difference]: With dead ends: 401 [2024-10-24 11:15:02,024 INFO L226 Difference]: Without dead ends: 299 [2024-10-24 11:15:02,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:15:02,025 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 264 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:02,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 761 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:15:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-24 11:15:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2024-10-24 11:15:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 264 states have (on average 1.3636363636363635) internal successors, (360), 264 states have internal predecessors, (360), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:15:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2024-10-24 11:15:02,038 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 91 [2024-10-24 11:15:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:02,039 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2024-10-24 11:15:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:15:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2024-10-24 11:15:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:15:02,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:02,040 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:02,054 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:15:02,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:02,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash 639957081, now seen corresponding path program 1 times [2024-10-24 11:15:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805391666] [2024-10-24 11:15:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:02,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:02,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:02,247 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 (14)] Waiting until timeout for monitored process [2024-10-24 11:15:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:02,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:15:02,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:02,614 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 9 treesize of output 3 [2024-10-24 11:15:02,854 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 15 treesize of output 7 [2024-10-24 11:15:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 11:15:02,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:15:03,303 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-10-24 11:15:03,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805391666] [2024-10-24 11:15:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805391666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:15:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [846407796] [2024-10-24 11:15:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:03,363 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:03,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:15:03,366 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:15:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-24 11:15:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:04,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:15:04,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:04,676 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 9 treesize of output 3 [2024-10-24 11:15:04,849 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 15 treesize of output 7 [2024-10-24 11:15:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 11:15:04,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:15:05,188 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-10-24 11:15:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [846407796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:15:05,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:15:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-24 11:15:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768029747] [2024-10-24 11:15:05,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:15:05,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:15:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:05,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:15:05,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:15:05,230 INFO L87 Difference]: Start difference. First operand 295 states and 414 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:15:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:05,800 INFO L93 Difference]: Finished difference Result 789 states and 1099 transitions. [2024-10-24 11:15:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:15:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 91 [2024-10-24 11:15:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:05,804 INFO L225 Difference]: With dead ends: 789 [2024-10-24 11:15:05,804 INFO L226 Difference]: Without dead ends: 495 [2024-10-24 11:15:05,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:15:05,806 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 232 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:05,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 669 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:15:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-24 11:15:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 368. [2024-10-24 11:15:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 326 states have internal predecessors, (439), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:15:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 511 transitions. [2024-10-24 11:15:05,832 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 511 transitions. Word has length 91 [2024-10-24 11:15:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:05,832 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 511 transitions. [2024-10-24 11:15:05,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:15:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 511 transitions. [2024-10-24 11:15:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:15:05,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:05,842 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:05,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-10-24 11:15:06,059 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 (14)] Ended with exit code 0 [2024-10-24 11:15:06,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:06,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1062658907, now seen corresponding path program 1 times [2024-10-24 11:15:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501381416] [2024-10-24 11:15:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:06,248 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:06,249 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 (16)] Waiting until timeout for monitored process [2024-10-24 11:15:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:06,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:15:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:06,640 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 9 treesize of output 3 [2024-10-24 11:15:06,971 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 15 treesize of output 7 [2024-10-24 11:15:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 11:15:07,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:15:07,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:15:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501381416] [2024-10-24 11:15:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501381416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:15:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724789874] [2024-10-24 11:15:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:15:07,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:15:07,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-24 11:15:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:08,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:15:08,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:15:08,377 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 9 treesize of output 3 [2024-10-24 11:15:08,612 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 15 treesize of output 7 [2024-10-24 11:15:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-24 11:15:08,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:15:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1724789874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:15:08,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:15:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-24 11:15:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546341973] [2024-10-24 11:15:08,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:15:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:15:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:15:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:15:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:15:08,697 INFO L87 Difference]: Start difference. First operand 368 states and 511 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:15:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:09,323 INFO L93 Difference]: Finished difference Result 789 states and 1095 transitions. [2024-10-24 11:15:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:15:09,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 91 [2024-10-24 11:15:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:09,326 INFO L225 Difference]: With dead ends: 789 [2024-10-24 11:15:09,326 INFO L226 Difference]: Without dead ends: 495 [2024-10-24 11:15:09,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:15:09,329 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 222 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:09,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 670 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:15:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-24 11:15:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 368. [2024-10-24 11:15:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 326 states have internal predecessors, (439), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:15:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 511 transitions. [2024-10-24 11:15:09,357 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 511 transitions. Word has length 91 [2024-10-24 11:15:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:09,357 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 511 transitions. [2024-10-24 11:15:09,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 11:15:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 511 transitions. [2024-10-24 11:15:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:15:09,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:09,358 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:09,372 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 (16)] Ended with exit code 0 [2024-10-24 11:15:09,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:15:09,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:09,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1008603988, now seen corresponding path program 1 times [2024-10-24 11:15:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:15:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658015948] [2024-10-24 11:15:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:09,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:15:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:15:09,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:15:09,763 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 (18)] Waiting until timeout for monitored process