./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-s_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-s_file-57.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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:30:08,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:30:08,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:30:08,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:30:08,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:30:08,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:30:08,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:30:08,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:30:08,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:30:08,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:30:08,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:30:08,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:30:08,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:30:08,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:30:08,637 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:30:08,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:30:08,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:30:08,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:30:08,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:30:08,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:30:08,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:30:08,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:30:08,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:30:08,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:30:08,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:30:08,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:30:08,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:30:08,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:30:08,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:30:08,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:30:08,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:30:08,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:30:08,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:30:08,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:30:08,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:30:08,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:30:08,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:30:08,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:30:08,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:30:08,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:30:08,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:30:08,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:30:08,646 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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e [2024-10-13 06:30:08,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:30:08,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:30:08,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:30:08,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:30:08,927 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:30:08,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:10,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:30:10,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:30:10,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:10,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a625cefd7/d53a5d68e0e745ea879084671fa707e6/FLAG4bac10fcc [2024-10-13 06:30:10,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a625cefd7/d53a5d68e0e745ea879084671fa707e6 [2024-10-13 06:30:10,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:30:10,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:30:10,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:30:10,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:30:10,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:30:10,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:30:10" (1/1) ... [2024-10-13 06:30:10,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109c88e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:10, skipping insertion in model container [2024-10-13 06:30:10,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:30:10" (1/1) ... [2024-10-13 06:30:10,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:30:10,972 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-s_file-57.i[916,929] [2024-10-13 06:30:11,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:30:11,028 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:30:11,041 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-s_file-57.i[916,929] [2024-10-13 06:30:11,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:30:11,109 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:30:11,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11 WrapperNode [2024-10-13 06:30:11,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:30:11,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:30:11,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:30:11,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:30:11,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,190 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-10-13 06:30:11,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:30:11,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:30:11,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:30:11,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:30:11,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,265 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:30:11,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:30:11,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:30:11,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:30:11,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:30:11,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (1/1) ... [2024-10-13 06:30:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:30:11,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:30:11,329 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-13 06:30:11,333 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-13 06:30:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:30:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:30:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:30:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:30:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:30:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:30:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:30:11,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:30:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:30:11,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:30:11,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:30:11,498 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:30:11,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:30:11,896 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-13 06:30:11,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:30:11,927 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:30:11,929 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:30:11,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:30:11 BoogieIcfgContainer [2024-10-13 06:30:11,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:30:11,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:30:11,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:30:11,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:30:11,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:30:10" (1/3) ... [2024-10-13 06:30:11,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bbabd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:30:11, skipping insertion in model container [2024-10-13 06:30:11,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:11" (2/3) ... [2024-10-13 06:30:11,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bbabd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:30:11, skipping insertion in model container [2024-10-13 06:30:11,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:30:11" (3/3) ... [2024-10-13 06:30:11,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:11,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:30:11,955 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:30:12,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:30:12,035 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;@49a762a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:30:12,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:30:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:30:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:30:12,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:12,049 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:12,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:12,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -649241732, now seen corresponding path program 1 times [2024-10-13 06:30:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598591037] [2024-10-13 06:30:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:12,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:12,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598591037] [2024-10-13 06:30:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598591037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:12,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:30:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511053309] [2024-10-13 06:30:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:30:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:30:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:30:12,400 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:12,446 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-13 06:30:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:30:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-13 06:30:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:12,455 INFO L225 Difference]: With dead ends: 177 [2024-10-13 06:30:12,456 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:30:12,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-13 06:30:12,463 INFO L432 NwaCegarLoop]: 126 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, 126 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-13 06:30:12,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:30:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:30:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:30:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-13 06:30:12,531 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-13 06:30:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-13 06:30:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-13 06:30:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:30:12,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:12,537 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:12,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:30:12,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -973939936, now seen corresponding path program 1 times [2024-10-13 06:30:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550852926] [2024-10-13 06:30:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550852926] [2024-10-13 06:30:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550852926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:30:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478733886] [2024-10-13 06:30:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:30:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:30:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:30:12,925 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:12,978 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2024-10-13 06:30:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:30:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-13 06:30:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:12,981 INFO L225 Difference]: With dead ends: 178 [2024-10-13 06:30:12,981 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:30:12,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-13 06:30:12,982 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:12,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:30:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 06:30:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:30:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-13 06:30:12,994 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 129 [2024-10-13 06:30:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:12,996 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-13 06:30:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-13 06:30:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:30:12,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:12,998 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:30:12,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -973880354, now seen corresponding path program 1 times [2024-10-13 06:30:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741569986] [2024-10-13 06:30:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741569986] [2024-10-13 06:30:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741569986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:30:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420632325] [2024-10-13 06:30:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:30:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:30:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:30:13,430 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:13,707 INFO L93 Difference]: Finished difference Result 269 states and 395 transitions. [2024-10-13 06:30:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:30:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-13 06:30:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:13,710 INFO L225 Difference]: With dead ends: 269 [2024-10-13 06:30:13,711 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 06:30:13,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:13,713 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 95 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:13,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 279 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 06:30:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2024-10-13 06:30:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 109 states have internal predecessors, (144), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2024-10-13 06:30:13,760 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 129 [2024-10-13 06:30:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2024-10-13 06:30:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2024-10-13 06:30:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:30:13,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:13,763 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:13,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:30:13,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1895747486, now seen corresponding path program 1 times [2024-10-13 06:30:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730429814] [2024-10-13 06:30:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730429814] [2024-10-13 06:30:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730429814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:14,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:14,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:30:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143048629] [2024-10-13 06:30:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:14,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:14,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:14,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:14,436 INFO L87 Difference]: Start difference. First operand 148 states and 216 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:14,658 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2024-10-13 06:30:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:14,659 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-13 06:30:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:14,661 INFO L225 Difference]: With dead ends: 300 [2024-10-13 06:30:14,661 INFO L226 Difference]: Without dead ends: 211 [2024-10-13 06:30:14,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:30:14,662 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:14,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 412 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-13 06:30:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 183. [2024-10-13 06:30:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 144 states have internal predecessors, (197), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2024-10-13 06:30:14,678 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 136 [2024-10-13 06:30:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:14,680 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2024-10-13 06:30:14,681 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2024-10-13 06:30:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:30:14,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:14,683 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:30:14,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1194682908, now seen corresponding path program 1 times [2024-10-13 06:30:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996221416] [2024-10-13 06:30:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:15,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:15,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996221416] [2024-10-13 06:30:15,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996221416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:15,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:30:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838558281] [2024-10-13 06:30:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:15,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:30:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:30:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:30:15,256 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:15,487 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2024-10-13 06:30:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:30:15,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-13 06:30:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:15,490 INFO L225 Difference]: With dead ends: 334 [2024-10-13 06:30:15,490 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 06:30:15,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:30:15,491 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 160 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:15,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 448 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 06:30:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 146. [2024-10-13 06:30:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-10-13 06:30:15,505 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 136 [2024-10-13 06:30:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-10-13 06:30:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-10-13 06:30:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:30:15,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:15,507 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:30:15,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash 877671551, now seen corresponding path program 1 times [2024-10-13 06:30:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341280218] [2024-10-13 06:30:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:15,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341280218] [2024-10-13 06:30:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341280218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:15,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837925153] [2024-10-13 06:30:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:15,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:15,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:15,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:15,834 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:15,960 INFO L93 Difference]: Finished difference Result 281 states and 407 transitions. [2024-10-13 06:30:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-13 06:30:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:15,961 INFO L225 Difference]: With dead ends: 281 [2024-10-13 06:30:15,962 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 06:30:15,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:15,963 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 70 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:15,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 271 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:30:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 06:30:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2024-10-13 06:30:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2024-10-13 06:30:15,982 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 139 [2024-10-13 06:30:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2024-10-13 06:30:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2024-10-13 06:30:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:30:15,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:15,985 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:15,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:30:15,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:15,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 484644541, now seen corresponding path program 1 times [2024-10-13 06:30:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:15,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114810773] [2024-10-13 06:30:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114810773] [2024-10-13 06:30:17,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114810773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:17,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:30:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634881323] [2024-10-13 06:30:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:17,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:17,116 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:17,298 INFO L93 Difference]: Finished difference Result 321 states and 465 transitions. [2024-10-13 06:30:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:17,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2024-10-13 06:30:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:17,301 INFO L225 Difference]: With dead ends: 321 [2024-10-13 06:30:17,301 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 06:30:17,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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-13 06:30:17,302 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 112 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:17,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 291 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 06:30:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2024-10-13 06:30:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2024-10-13 06:30:17,319 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 139 [2024-10-13 06:30:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:17,319 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2024-10-13 06:30:17,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2024-10-13 06:30:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:30:17,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:17,322 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:17,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:30:17,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:17,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash 907346367, now seen corresponding path program 1 times [2024-10-13 06:30:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359579189] [2024-10-13 06:30:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 06:30:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359579189] [2024-10-13 06:30:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359579189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315451142] [2024-10-13 06:30:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:30:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:30:19,300 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-13 06:30:19,301 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-13 06:30:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:19,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-13 06:30:19,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:19,609 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-13 06:30:19,708 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 15 [2024-10-13 06:30:19,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:19,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:30:20,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-10-13 06:30:20,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:20,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 51 [2024-10-13 06:30:20,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:20,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 61 [2024-10-13 06:30:20,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:20,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 61 [2024-10-13 06:30:20,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:20,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 193 treesize of output 114 [2024-10-13 06:30:21,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:21,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 351 treesize of output 147 [2024-10-13 06:30:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 376 proven. 63 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-13 06:30:21,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315451142] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:21,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:30:21,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 28] total 34 [2024-10-13 06:30:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091543856] [2024-10-13 06:30:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 06:30:21,408 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:21,696 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2024-10-13 06:30:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-13 06:30:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:21,698 INFO L225 Difference]: With dead ends: 356 [2024-10-13 06:30:21,698 INFO L226 Difference]: Without dead ends: 235 [2024-10-13 06:30:21,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 06:30:21,699 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 66 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:21,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 584 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-13 06:30:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2024-10-13 06:30:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 183 states have internal predecessors, (240), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 06:30:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2024-10-13 06:30:21,719 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 139 [2024-10-13 06:30:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2024-10-13 06:30:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2024-10-13 06:30:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:21,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:21,721 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:21,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:30:21,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:30:21,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:21,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2085631824, now seen corresponding path program 1 times [2024-10-13 06:30:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156423208] [2024-10-13 06:30:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156423208] [2024-10-13 06:30:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156423208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891833851] [2024-10-13 06:30:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:22,147 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:22,280 INFO L93 Difference]: Finished difference Result 482 states and 684 transitions. [2024-10-13 06:30:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:22,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:22,284 INFO L225 Difference]: With dead ends: 482 [2024-10-13 06:30:22,284 INFO L226 Difference]: Without dead ends: 293 [2024-10-13 06:30:22,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:22,285 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 91 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:22,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 332 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:30:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-13 06:30:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-10-13 06:30:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 238 states have internal predecessors, (310), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:30:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 406 transitions. [2024-10-13 06:30:22,299 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 406 transitions. Word has length 140 [2024-10-13 06:30:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 406 transitions. [2024-10-13 06:30:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 406 transitions. [2024-10-13 06:30:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:22,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:22,301 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:22,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:30:22,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:22,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 890310932, now seen corresponding path program 1 times [2024-10-13 06:30:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134232652] [2024-10-13 06:30:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134232652] [2024-10-13 06:30:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134232652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:22,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856066636] [2024-10-13 06:30:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:22,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:22,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:22,466 INFO L87 Difference]: Start difference. First operand 290 states and 406 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:22,653 INFO L93 Difference]: Finished difference Result 603 states and 841 transitions. [2024-10-13 06:30:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:22,656 INFO L225 Difference]: With dead ends: 603 [2024-10-13 06:30:22,656 INFO L226 Difference]: Without dead ends: 356 [2024-10-13 06:30:22,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:22,657 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 52 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:22,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 435 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-13 06:30:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2024-10-13 06:30:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.3003412969283277) internal successors, (381), 296 states have internal predecessors, (381), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 06:30:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 485 transitions. [2024-10-13 06:30:22,682 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 485 transitions. Word has length 140 [2024-10-13 06:30:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:22,682 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 485 transitions. [2024-10-13 06:30:22,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 485 transitions. [2024-10-13 06:30:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:22,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:22,683 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:22,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:30:22,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:22,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -120806318, now seen corresponding path program 1 times [2024-10-13 06:30:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933651897] [2024-10-13 06:30:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:22,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:22,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933651897] [2024-10-13 06:30:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933651897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960343911] [2024-10-13 06:30:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:22,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:22,919 INFO L87 Difference]: Start difference. First operand 353 states and 485 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:23,079 INFO L93 Difference]: Finished difference Result 656 states and 899 transitions. [2024-10-13 06:30:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:23,083 INFO L225 Difference]: With dead ends: 656 [2024-10-13 06:30:23,083 INFO L226 Difference]: Without dead ends: 346 [2024-10-13 06:30:23,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:23,085 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 45 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:23,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 397 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:30:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-13 06:30:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2024-10-13 06:30:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 284 states have (on average 1.2922535211267605) internal successors, (367), 287 states have internal predecessors, (367), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 06:30:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 471 transitions. [2024-10-13 06:30:23,109 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 471 transitions. Word has length 140 [2024-10-13 06:30:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:23,110 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 471 transitions. [2024-10-13 06:30:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 471 transitions. [2024-10-13 06:30:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:23,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:23,113 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:30:23,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1944434102, now seen corresponding path program 1 times [2024-10-13 06:30:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089195831] [2024-10-13 06:30:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089195831] [2024-10-13 06:30:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089195831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:30:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171168019] [2024-10-13 06:30:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:30:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:30:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:30:23,202 INFO L87 Difference]: Start difference. First operand 344 states and 471 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:23,231 INFO L93 Difference]: Finished difference Result 649 states and 890 transitions. [2024-10-13 06:30:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:30:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:23,234 INFO L225 Difference]: With dead ends: 649 [2024-10-13 06:30:23,234 INFO L226 Difference]: Without dead ends: 348 [2024-10-13 06:30:23,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-13 06:30:23,236 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:23,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-13 06:30:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-13 06:30:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 288 states have (on average 1.2881944444444444) internal successors, (371), 291 states have internal predecessors, (371), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 06:30:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2024-10-13 06:30:23,261 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 142 [2024-10-13 06:30:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2024-10-13 06:30:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2024-10-13 06:30:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:23,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:23,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:30:23,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1243369524, now seen corresponding path program 1 times [2024-10-13 06:30:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583960894] [2024-10-13 06:30:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:30:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:30:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:30:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:30:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:30:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:30:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:30:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:30:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:30:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:30:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:30:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:30:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:30:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:30:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:30:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:30:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:30:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:30:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:30:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583960894] [2024-10-13 06:30:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583960894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:30:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481926532] [2024-10-13 06:30:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:30:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:23,428 INFO L87 Difference]: Start difference. First operand 348 states and 475 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:23,470 INFO L93 Difference]: Finished difference Result 669 states and 910 transitions. [2024-10-13 06:30:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:23,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:23,474 INFO L225 Difference]: With dead ends: 669 [2024-10-13 06:30:23,474 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 06:30:23,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:23,476 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:23,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 06:30:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 358. [2024-10-13 06:30:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 298 states have (on average 1.278523489932886) internal successors, (381), 301 states have internal predecessors, (381), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 06:30:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 485 transitions. [2024-10-13 06:30:23,493 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 485 transitions. Word has length 142 [2024-10-13 06:30:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 485 transitions. [2024-10-13 06:30:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 485 transitions. [2024-10-13 06:30:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:23,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:23,495 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:30:23,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1188932270, now seen corresponding path program 1 times [2024-10-13 06:30:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:30:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97820113] [2024-10-13 06:30:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:30:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:30:23,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:30:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:30:23,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:30:23,685 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:30:23,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:30:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:30:23,689 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:30:23,758 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:30:23,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:30:23 BoogieIcfgContainer [2024-10-13 06:30:23,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:30:23,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:30:23,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:30:23,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:30:23,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:30:11" (3/4) ... [2024-10-13 06:30:23,764 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:30:23,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:30:23,765 INFO L158 Benchmark]: Toolchain (without parser) took 12967.47ms. Allocated memory was 178.3MB in the beginning and 599.8MB in the end (delta: 421.5MB). Free memory was 109.6MB in the beginning and 236.1MB in the end (delta: -126.5MB). Peak memory consumption was 296.4MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,765 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:30:23,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.56ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 92.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.63ms. Allocated memory is still 178.3MB. Free memory was 92.6MB in the beginning and 147.9MB in the end (delta: -55.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,766 INFO L158 Benchmark]: Boogie Preprocessor took 92.14ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 144.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,766 INFO L158 Benchmark]: RCFGBuilder took 636.18ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 111.7MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,766 INFO L158 Benchmark]: TraceAbstraction took 11830.35ms. Allocated memory was 178.3MB in the beginning and 599.8MB in the end (delta: 421.5MB). Free memory was 111.0MB in the beginning and 236.1MB in the end (delta: -125.1MB). Peak memory consumption was 297.9MB. Max. memory is 16.1GB. [2024-10-13 06:30:23,767 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 599.8MB. Free memory is still 236.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:30:23,768 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.14ms. Allocated memory is still 104.9MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.56ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 92.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.63ms. Allocated memory is still 178.3MB. Free memory was 92.6MB in the beginning and 147.9MB in the end (delta: -55.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.14ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 144.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.18ms. Allocated memory is still 178.3MB. Free memory was 143.9MB in the beginning and 111.7MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11830.35ms. Allocated memory was 178.3MB in the beginning and 599.8MB in the end (delta: 421.5MB). Free memory was 111.0MB in the beginning and 236.1MB in the end (delta: -125.1MB). Peak memory consumption was 297.9MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 599.8MB. Free memory is still 236.1MB. 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 119. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed char last_1_WrapperStruct00_var_1_9 = 64; [L54] signed char last_1_WrapperStruct00_var_1_14 = -64; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L115] EXPR WrapperStruct00.var_1_9 [L115] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L116] EXPR WrapperStruct00.var_1_14 [L116] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L127] RET updateVariables() [L128] CALL step() [L58] EXPR WrapperStruct00.var_1_6 [L58] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L59] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=-255] [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L60] COND TRUE (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && stepLocal_0 [L61] WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR WrapperStruct00.var_1_15 [L68] EXPR WrapperStruct00.var_1_16 [L68] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) [L68] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] signed long int stepLocal_3 = (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))); [L69] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L69] COND TRUE WrapperStruct00.var_1_12 < stepLocal_3 [L70] EXPR WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_13 [L70] WrapperStruct00.var_1_14 = ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13) [L74] WrapperStruct00.var_1_17 = 128.91f [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned char stepLocal_2 = WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_5 [L76] unsigned char stepLocal_1 = WrapperStruct00.var_1_5; [L77] stepLocal_1 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0] [L77] stepLocal_1 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L77] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_13 [L82] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 [L119] EXPR WrapperStruct00.var_1_6 [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) [L119] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) [L119] EXPR WrapperStruct00.var_1_14 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) [L119] EXPR WrapperStruct00.var_1_17 [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119-L120] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 746 mSDsluCounter, 4786 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3276 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 1510 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 874 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=13, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 226 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2061 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2043 ConstructedInterpolants, 0 QuantifiedInterpolants, 10100 SizeOfPredicates, 10 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 9102/9180 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-13 06:30:23,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:30:25,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:30:25,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:30:25,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:30:25,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:30:25,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:30:25,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:30:25,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:30:25,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:30:25,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:30:25,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:30:25,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:30:25,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:30:25,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:30:25,921 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:30:25,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:30:25,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:30:25,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:30:25,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:30:25,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:30:25,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:30:25,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:30:25,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:30:25,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:30:25,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:30:25,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:30:25,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:30:25,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:30:25,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:30:25,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:30:25,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:30:25,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:30:25,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:30:25,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:30:25,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:30:25,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:30:25,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:30:25,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:30:25,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:30:25,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:30:25,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:30:25,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:30:25,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:30:25,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:30:25,929 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:30:25,929 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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e [2024-10-13 06:30:26,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:30:26,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:30:26,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:30:26,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:30:26,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:30:26,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:27,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:30:27,734 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:30:27,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:27,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a6c15b3/e6c7fb4acd1745889a6bf2698aa09509/FLAGf56b3653d [2024-10-13 06:30:28,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a6c15b3/e6c7fb4acd1745889a6bf2698aa09509 [2024-10-13 06:30:28,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:30:28,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:30:28,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:30:28,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:30:28,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:30:28,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6deef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28, skipping insertion in model container [2024-10-13 06:30:28,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:30:28,329 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-s_file-57.i[916,929] [2024-10-13 06:30:28,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:30:28,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:30:28,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-s_file-57.i[916,929] [2024-10-13 06:30:28,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:30:28,483 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:30:28,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28 WrapperNode [2024-10-13 06:30:28,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:30:28,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:30:28,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:30:28,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:30:28,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,568 INFO L138 Inliner]: procedures = 33, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2024-10-13 06:30:28,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:30:28,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:30:28,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:30:28,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:30:28,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,620 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:30:28,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:30:28,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:30:28,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:30:28,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:30:28,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (1/1) ... [2024-10-13 06:30:28,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:30:28,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:30:28,706 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-13 06:30:28,709 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-13 06:30:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:30:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:30:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:30:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:30:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:30:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:30:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:30:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:30:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:30:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:30:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:30:28,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:30:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:30:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:30:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:30:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:30:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:30:28,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:30:28,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:30:29,345 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-13 06:30:29,345 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:30:29,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:30:29,384 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:30:29,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:30:29 BoogieIcfgContainer [2024-10-13 06:30:29,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:30:29,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:30:29,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:30:29,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:30:29,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:30:28" (1/3) ... [2024-10-13 06:30:29,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a5484c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:30:29, skipping insertion in model container [2024-10-13 06:30:29,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:30:28" (2/3) ... [2024-10-13 06:30:29,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a5484c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:30:29, skipping insertion in model container [2024-10-13 06:30:29,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:30:29" (3/3) ... [2024-10-13 06:30:29,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i [2024-10-13 06:30:29,407 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:30:29,408 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:30:29,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:30:29,480 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;@3a71b761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:30:29,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:30:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:30:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:30:29,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:29,495 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:29,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -649241732, now seen corresponding path program 1 times [2024-10-13 06:30:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702395928] [2024-10-13 06:30:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:29,519 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-13 06:30:29,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:29,521 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-13 06:30:29,522 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-13 06:30:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:29,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:30:29,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 06:30:29,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:29,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:29,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702395928] [2024-10-13 06:30:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702395928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:30:29,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668347920] [2024-10-13 06:30:29,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:29,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:30:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:30:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:30:29,777 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:29,820 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2024-10-13 06:30:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:30:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-13 06:30:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:29,831 INFO L225 Difference]: With dead ends: 177 [2024-10-13 06:30:29,831 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:30:29,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-13 06:30:29,841 INFO L432 NwaCegarLoop]: 126 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, 126 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-13 06:30:29,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:30:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:30:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:30:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-13 06:30:29,875 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2024-10-13 06:30:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:29,875 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-13 06:30:29,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:30:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-13 06:30:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:30:29,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:29,878 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:29,883 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-13 06:30:30,078 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-13 06:30:30,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:30,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash -973939936, now seen corresponding path program 1 times [2024-10-13 06:30:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957083798] [2024-10-13 06:30:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:30,081 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-13 06:30:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:30,083 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-13 06:30:30,091 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-13 06:30:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:30,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:30:30,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:30,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:30,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2024-10-13 06:30:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:30,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:30,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957083798] [2024-10-13 06:30:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957083798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:30:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272614413] [2024-10-13 06:30:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:30,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:30:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:30,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:30:30,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:30:30,846 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:31,186 INFO L93 Difference]: Finished difference Result 263 states and 389 transitions. [2024-10-13 06:30:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:30:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-13 06:30:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:31,189 INFO L225 Difference]: With dead ends: 263 [2024-10-13 06:30:31,189 INFO L226 Difference]: Without dead ends: 176 [2024-10-13 06:30:31,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:31,191 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 92 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:31,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 279 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:30:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-13 06:30:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2024-10-13 06:30:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2024-10-13 06:30:31,213 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 129 [2024-10-13 06:30:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:31,214 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2024-10-13 06:30:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2024-10-13 06:30:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:30:31,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:31,216 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:31,221 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-13 06:30:31,416 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-13 06:30:31,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1895807068, now seen corresponding path program 1 times [2024-10-13 06:30:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980680146] [2024-10-13 06:30:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:31,419 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-13 06:30:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:31,422 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-13 06:30:31,423 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-13 06:30:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:31,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:30:31,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:31,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:31,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980680146] [2024-10-13 06:30:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980680146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376744856] [2024-10-13 06:30:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:31,602 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:31,649 INFO L93 Difference]: Finished difference Result 238 states and 350 transitions. [2024-10-13 06:30:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-13 06:30:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:31,651 INFO L225 Difference]: With dead ends: 238 [2024-10-13 06:30:31,651 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 06:30:31,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:31,654 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:31,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 06:30:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-10-13 06:30:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2024-10-13 06:30:31,673 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 136 [2024-10-13 06:30:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:31,673 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2024-10-13 06:30:31,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2024-10-13 06:30:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:30:31,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:31,675 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:31,681 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-13 06:30:31,875 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-13 06:30:31,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:31,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:31,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1895747486, now seen corresponding path program 1 times [2024-10-13 06:30:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:31,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982301542] [2024-10-13 06:30:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:31,878 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-13 06:30:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:31,880 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-13 06:30:31,881 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-13 06:30:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:32,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:30:32,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:32,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:30:32,129 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 26 treesize of output 25 [2024-10-13 06:30:32,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 06:30:32,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-13 06:30:32,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-13 06:30:32,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-13 06:30:32,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:30:32,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:32,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:30:33,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:33,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:30:33,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:33,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 59 [2024-10-13 06:30:33,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 88 [2024-10-13 06:30:33,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:33,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 92 [2024-10-13 06:30:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 387 proven. 48 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-13 06:30:33,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:33,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982301542] [2024-10-13 06:30:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982301542] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:33,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:30:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-10-13 06:30:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335475158] [2024-10-13 06:30:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:30:33,668 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:33,900 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2024-10-13 06:30:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-13 06:30:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:33,902 INFO L225 Difference]: With dead ends: 309 [2024-10-13 06:30:33,902 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 06:30:33,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:30:33,904 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 116 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:33,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 235 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 06:30:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 170. [2024-10-13 06:30:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 131 states have internal predecessors, (176), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 248 transitions. [2024-10-13 06:30:33,935 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 248 transitions. Word has length 136 [2024-10-13 06:30:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:33,936 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 248 transitions. [2024-10-13 06:30:33,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 248 transitions. [2024-10-13 06:30:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:30:33,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:33,939 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:33,948 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 (5)] Ended with exit code 0 [2024-10-13 06:30:34,140 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-13 06:30:34,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:34,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 405075104, now seen corresponding path program 1 times [2024-10-13 06:30:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:34,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403235266] [2024-10-13 06:30:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:34,143 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-13 06:30:34,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:34,145 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-13 06:30:34,146 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-13 06:30:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:34,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 06:30:34,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:34,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:34,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2024-10-13 06:30:34,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:30:34,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:34,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-10-13 06:30:34,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:34,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-10-13 06:30:34,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 80 [2024-10-13 06:30:34,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:34,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 80 [2024-10-13 06:30:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:35,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:35,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403235266] [2024-10-13 06:30:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403235266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:35,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:35,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:30:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611472002] [2024-10-13 06:30:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:35,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:30:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:30:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:30:35,021 INFO L87 Difference]: Start difference. First operand 170 states and 248 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:36,088 INFO L93 Difference]: Finished difference Result 380 states and 552 transitions. [2024-10-13 06:30:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:30:36,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-10-13 06:30:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:36,092 INFO L225 Difference]: With dead ends: 380 [2024-10-13 06:30:36,092 INFO L226 Difference]: Without dead ends: 279 [2024-10-13 06:30:36,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:30:36,093 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 207 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:36,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 527 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:30:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-13 06:30:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 177. [2024-10-13 06:30:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.3478260869565217) internal successors, (186), 138 states have internal predecessors, (186), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2024-10-13 06:30:36,117 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 136 [2024-10-13 06:30:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:36,118 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2024-10-13 06:30:36,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2024-10-13 06:30:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:30:36,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:36,124 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:36,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:36,325 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-13 06:30:36,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1300373377, now seen corresponding path program 1 times [2024-10-13 06:30:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129627601] [2024-10-13 06:30:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:36,327 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-13 06:30:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:36,328 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-13 06:30:36,329 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-13 06:30:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:36,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:30:36,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:36,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:36,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129627601] [2024-10-13 06:30:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129627601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584222014] [2024-10-13 06:30:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:36,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:36,494 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:36,711 INFO L93 Difference]: Finished difference Result 318 states and 462 transitions. [2024-10-13 06:30:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2024-10-13 06:30:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:36,713 INFO L225 Difference]: With dead ends: 318 [2024-10-13 06:30:36,713 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 06:30:36,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 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-13 06:30:36,714 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 37 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:36,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 341 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 06:30:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2024-10-13 06:30:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:30:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2024-10-13 06:30:36,726 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 139 [2024-10-13 06:30:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:36,726 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2024-10-13 06:30:36,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2024-10-13 06:30:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:30:36,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:36,730 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:36,737 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-13 06:30:36,931 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-13 06:30:36,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:36,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 907346367, now seen corresponding path program 1 times [2024-10-13 06:30:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865963023] [2024-10-13 06:30:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:36,932 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-13 06:30:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:36,935 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-13 06:30:36,936 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-13 06:30:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:37,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 06:30:37,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:37,146 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-13 06:30:37,191 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 25 treesize of output 24 [2024-10-13 06:30:37,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-13 06:30:37,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-10-13 06:30:37,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 53 [2024-10-13 06:30:37,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 73 [2024-10-13 06:30:37,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 76 [2024-10-13 06:30:37,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:37,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 107 treesize of output 94 [2024-10-13 06:30:38,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:38,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 157 treesize of output 85 [2024-10-13 06:30:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-13 06:30:38,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:38,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865963023] [2024-10-13 06:30:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865963023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:38,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:30:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894003528] [2024-10-13 06:30:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:38,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:30:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:30:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:30:38,161 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-13 06:30:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:39,922 INFO L93 Difference]: Finished difference Result 491 states and 708 transitions. [2024-10-13 06:30:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:30:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 139 [2024-10-13 06:30:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:39,927 INFO L225 Difference]: With dead ends: 491 [2024-10-13 06:30:39,927 INFO L226 Difference]: Without dead ends: 382 [2024-10-13 06:30:39,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:30:39,928 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 474 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:39,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 542 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 06:30:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-13 06:30:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 376. [2024-10-13 06:30:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 313 states have (on average 1.3642172523961662) internal successors, (427), 315 states have internal predecessors, (427), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:30:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2024-10-13 06:30:39,957 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 139 [2024-10-13 06:30:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2024-10-13 06:30:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-13 06:30:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2024-10-13 06:30:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:39,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:39,960 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:39,967 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-13 06:30:40,160 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-13 06:30:40,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2085631824, now seen corresponding path program 1 times [2024-10-13 06:30:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108746513] [2024-10-13 06:30:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:40,161 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-13 06:30:40,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:40,163 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-13 06:30:40,163 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-13 06:30:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:40,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:30:40,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:40,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:40,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108746513] [2024-10-13 06:30:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108746513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:40,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:40,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:40,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185937472] [2024-10-13 06:30:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:40,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:40,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:40,317 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:40,587 INFO L93 Difference]: Finished difference Result 801 states and 1151 transitions. [2024-10-13 06:30:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:40,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:40,591 INFO L225 Difference]: With dead ends: 801 [2024-10-13 06:30:40,591 INFO L226 Difference]: Without dead ends: 528 [2024-10-13 06:30:40,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:40,592 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:40,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 445 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-13 06:30:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 524. [2024-10-13 06:30:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 451 states have (on average 1.3458980044345898) internal successors, (607), 455 states have internal predecessors, (607), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 06:30:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 739 transitions. [2024-10-13 06:30:40,627 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 739 transitions. Word has length 140 [2024-10-13 06:30:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:40,627 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 739 transitions. [2024-10-13 06:30:40,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 739 transitions. [2024-10-13 06:30:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:40,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:40,628 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:40,634 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-13 06:30:40,832 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 [2024-10-13 06:30:40,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:40,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1074514574, now seen corresponding path program 1 times [2024-10-13 06:30:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356787968] [2024-10-13 06:30:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:40,834 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-13 06:30:40,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:40,836 INFO L229 MonitoredProcess]: Starting monitored process 10 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-13 06:30:40,838 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 (10)] Waiting until timeout for monitored process [2024-10-13 06:30:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:40,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:30:40,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:41,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:41,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356787968] [2024-10-13 06:30:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356787968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:41,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544884033] [2024-10-13 06:30:41,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:41,013 INFO L87 Difference]: Start difference. First operand 524 states and 739 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:41,268 INFO L93 Difference]: Finished difference Result 1050 states and 1475 transitions. [2024-10-13 06:30:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:41,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:41,271 INFO L225 Difference]: With dead ends: 1050 [2024-10-13 06:30:41,271 INFO L226 Difference]: Without dead ends: 683 [2024-10-13 06:30:41,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:41,273 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 49 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:41,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 418 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-13 06:30:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2024-10-13 06:30:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 603 states have internal predecessors, (797), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 06:30:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 937 transitions. [2024-10-13 06:30:41,311 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 937 transitions. Word has length 140 [2024-10-13 06:30:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:41,311 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 937 transitions. [2024-10-13 06:30:41,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 937 transitions. [2024-10-13 06:30:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:41,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:41,313 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:41,321 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-13 06:30:41,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -120806318, now seen corresponding path program 1 times [2024-10-13 06:30:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130579265] [2024-10-13 06:30:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:41,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:30:41,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:41,517 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-13 06:30:41,520 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-13 06:30:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:41,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:30:41,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:41,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:41,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130579265] [2024-10-13 06:30:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130579265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799935863] [2024-10-13 06:30:41,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:41,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:41,680 INFO L87 Difference]: Start difference. First operand 679 states and 937 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:41,954 INFO L93 Difference]: Finished difference Result 1397 states and 1929 transitions. [2024-10-13 06:30:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:41,958 INFO L225 Difference]: With dead ends: 1397 [2024-10-13 06:30:41,958 INFO L226 Difference]: Without dead ends: 885 [2024-10-13 06:30:41,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:41,959 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 46 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:41,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 427 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-13 06:30:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 715. [2024-10-13 06:30:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 633 states have (on average 1.334913112164297) internal successors, (845), 639 states have internal predecessors, (845), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 06:30:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 985 transitions. [2024-10-13 06:30:41,995 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 985 transitions. Word has length 140 [2024-10-13 06:30:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:41,996 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 985 transitions. [2024-10-13 06:30:41,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 985 transitions. [2024-10-13 06:30:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:30:41,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:41,997 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:42,003 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 (11)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:42,201 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 [2024-10-13 06:30:42,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 98048400, now seen corresponding path program 1 times [2024-10-13 06:30:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:42,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882271441] [2024-10-13 06:30:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:42,202 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-13 06:30:42,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:42,204 INFO L229 MonitoredProcess]: Starting monitored process 12 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-13 06:30:42,204 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 (12)] Waiting until timeout for monitored process [2024-10-13 06:30:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:42,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 06:30:42,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:42,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:42,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882271441] [2024-10-13 06:30:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882271441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:42,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:30:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73885010] [2024-10-13 06:30:42,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:42,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:30:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:42,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:30:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:30:42,330 INFO L87 Difference]: Start difference. First operand 715 states and 985 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:42,376 INFO L93 Difference]: Finished difference Result 1227 states and 1689 transitions. [2024-10-13 06:30:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:30:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:30:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:42,380 INFO L225 Difference]: With dead ends: 1227 [2024-10-13 06:30:42,380 INFO L226 Difference]: Without dead ends: 653 [2024-10-13 06:30:42,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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-13 06:30:42,382 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:42,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-10-13 06:30:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2024-10-13 06:30:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 571 states have (on average 1.320490367775832) internal successors, (754), 577 states have internal predecessors, (754), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 06:30:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 894 transitions. [2024-10-13 06:30:42,430 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 894 transitions. Word has length 140 [2024-10-13 06:30:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:42,430 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 894 transitions. [2024-10-13 06:30:42,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 894 transitions. [2024-10-13 06:30:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:30:42,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:42,432 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:42,437 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 (12)] Ended with exit code 0 [2024-10-13 06:30:42,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-13 06:30:42,632 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1618835613, now seen corresponding path program 1 times [2024-10-13 06:30:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511519298] [2024-10-13 06:30:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:42,634 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-13 06:30:42,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:42,636 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-13 06:30:42,637 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-13 06:30:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:42,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:30:42,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:42,825 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 1 [2024-10-13 06:30:42,860 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 26 treesize of output 25 [2024-10-13 06:30:43,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-13 06:30:43,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:30:43,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 54 [2024-10-13 06:30:43,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-13 06:30:43,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-13 06:30:43,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 77 [2024-10-13 06:30:43,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:43,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 73 [2024-10-13 06:30:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 381 proven. 33 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-13 06:30:44,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:44,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511519298] [2024-10-13 06:30:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511519298] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:30:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 21 [2024-10-13 06:30:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831723367] [2024-10-13 06:30:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:30:44,176 INFO L87 Difference]: Start difference. First operand 653 states and 894 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:44,594 INFO L93 Difference]: Finished difference Result 1209 states and 1656 transitions. [2024-10-13 06:30:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-13 06:30:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:44,599 INFO L225 Difference]: With dead ends: 1209 [2024-10-13 06:30:44,599 INFO L226 Difference]: Without dead ends: 733 [2024-10-13 06:30:44,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:30:44,602 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:44,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 561 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:30:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-13 06:30:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 729. [2024-10-13 06:30:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 635 states have (on average 1.3133858267716536) internal successors, (834), 642 states have internal predecessors, (834), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 06:30:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 994 transitions. [2024-10-13 06:30:44,641 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 994 transitions. Word has length 141 [2024-10-13 06:30:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:44,642 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 994 transitions. [2024-10-13 06:30:44,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 994 transitions. [2024-10-13 06:30:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:44,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:44,644 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:44,651 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-13 06:30:44,844 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-13 06:30:44,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1944434102, now seen corresponding path program 1 times [2024-10-13 06:30:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:44,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916299615] [2024-10-13 06:30:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:44,846 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-13 06:30:44,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:44,849 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-13 06:30:44,850 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-13 06:30:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:44,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:30:44,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:45,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:45,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916299615] [2024-10-13 06:30:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916299615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:30:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444437425] [2024-10-13 06:30:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:45,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:30:45,029 INFO L87 Difference]: Start difference. First operand 729 states and 994 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:45,325 INFO L93 Difference]: Finished difference Result 1592 states and 2150 transitions. [2024-10-13 06:30:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:45,331 INFO L225 Difference]: With dead ends: 1592 [2024-10-13 06:30:45,332 INFO L226 Difference]: Without dead ends: 1047 [2024-10-13 06:30:45,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:45,334 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 43 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:45,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 338 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:30:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-13 06:30:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 963. [2024-10-13 06:30:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 852 states have (on average 1.2875586854460095) internal successors, (1097), 863 states have internal predecessors, (1097), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 06:30:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1281 transitions. [2024-10-13 06:30:45,391 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1281 transitions. Word has length 142 [2024-10-13 06:30:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1281 transitions. [2024-10-13 06:30:45,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1281 transitions. [2024-10-13 06:30:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:45,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:45,394 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:45,400 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 (14)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-13 06:30:45,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1188932270, now seen corresponding path program 1 times [2024-10-13 06:30:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796823759] [2024-10-13 06:30:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:45,598 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-13 06:30:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:45,600 INFO L229 MonitoredProcess]: Starting monitored process 15 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-13 06:30:45,601 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 (15)] Waiting until timeout for monitored process [2024-10-13 06:30:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:45,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:30:45,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:45,891 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 1 [2024-10-13 06:30:45,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:45,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-10-13 06:30:46,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:46,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 53 [2024-10-13 06:30:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:46,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:46,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796823759] [2024-10-13 06:30:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796823759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:30:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951620262] [2024-10-13 06:30:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:46,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:30:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:30:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:30:46,115 INFO L87 Difference]: Start difference. First operand 963 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:47,035 INFO L93 Difference]: Finished difference Result 993 states and 1321 transitions. [2024-10-13 06:30:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:30:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:47,041 INFO L225 Difference]: With dead ends: 993 [2024-10-13 06:30:47,041 INFO L226 Difference]: Without dead ends: 991 [2024-10-13 06:30:47,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:30:47,042 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 174 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:47,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 488 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:30:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-10-13 06:30:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 987. [2024-10-13 06:30:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 876 states have (on average 1.2796803652968036) internal successors, (1121), 887 states have internal predecessors, (1121), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 06:30:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1305 transitions. [2024-10-13 06:30:47,106 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1305 transitions. Word has length 142 [2024-10-13 06:30:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1305 transitions. [2024-10-13 06:30:47,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1305 transitions. [2024-10-13 06:30:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:47,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:47,113 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:47,119 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 (15)] Ended with exit code 0 [2024-10-13 06:30:47,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-13 06:30:47,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1188872688, now seen corresponding path program 1 times [2024-10-13 06:30:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:47,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507456230] [2024-10-13 06:30:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:47,315 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-13 06:30:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:47,317 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-13 06:30:47,319 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-13 06:30:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:47,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 06:30:47,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:47,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:30:47,572 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 31 treesize of output 15 [2024-10-13 06:30:47,592 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 26 treesize of output 25 [2024-10-13 06:30:47,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:47,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 38 [2024-10-13 06:30:48,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:48,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 63 [2024-10-13 06:30:48,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:48,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 66 [2024-10-13 06:30:48,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:48,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 93 [2024-10-13 06:30:48,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:48,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 93 [2024-10-13 06:30:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 315 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 06:30:48,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:48,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507456230] [2024-10-13 06:30:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507456230] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:30:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 24 [2024-10-13 06:30:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436506462] [2024-10-13 06:30:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:30:48,834 INFO L87 Difference]: Start difference. First operand 987 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:49,320 INFO L93 Difference]: Finished difference Result 1777 states and 2357 transitions. [2024-10-13 06:30:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:49,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:49,324 INFO L225 Difference]: With dead ends: 1777 [2024-10-13 06:30:49,325 INFO L226 Difference]: Without dead ends: 1008 [2024-10-13 06:30:49,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2024-10-13 06:30:49,327 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 73 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:49,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 548 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:30:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-10-13 06:30:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1005. [2024-10-13 06:30:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 894 states have (on average 1.274049217002237) internal successors, (1139), 905 states have internal predecessors, (1139), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 06:30:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1323 transitions. [2024-10-13 06:30:49,397 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1323 transitions. Word has length 142 [2024-10-13 06:30:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1323 transitions. [2024-10-13 06:30:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1323 transitions. [2024-10-13 06:30:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:30:49,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:49,400 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:49,406 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-13 06:30:49,600 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 [2024-10-13 06:30:49,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1463249870, now seen corresponding path program 1 times [2024-10-13 06:30:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:49,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779639643] [2024-10-13 06:30:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:49,602 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-13 06:30:49,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:49,605 INFO L229 MonitoredProcess]: Starting monitored process 17 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-13 06:30:49,606 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 (17)] Waiting until timeout for monitored process [2024-10-13 06:30:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:49,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:30:49,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:49,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:30:49,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779639643] [2024-10-13 06:30:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779639643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:30:49,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:30:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:30:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067285988] [2024-10-13 06:30:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:30:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:30:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:49,774 INFO L87 Difference]: Start difference. First operand 1005 states and 1323 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:49,870 INFO L93 Difference]: Finished difference Result 1824 states and 2407 transitions. [2024-10-13 06:30:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:30:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:30:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:49,875 INFO L225 Difference]: With dead ends: 1824 [2024-10-13 06:30:49,875 INFO L226 Difference]: Without dead ends: 1037 [2024-10-13 06:30:49,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:30:49,877 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:49,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:30:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-10-13 06:30:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1025. [2024-10-13 06:30:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 914 states have (on average 1.2680525164113785) internal successors, (1159), 925 states have internal predecessors, (1159), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 06:30:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1343 transitions. [2024-10-13 06:30:49,932 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1343 transitions. Word has length 142 [2024-10-13 06:30:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:49,933 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1343 transitions. [2024-10-13 06:30:49,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1343 transitions. [2024-10-13 06:30:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:30:49,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:49,935 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:49,941 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 (17)] Ended with exit code 0 [2024-10-13 06:30:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-13 06:30:50,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1434245487, now seen corresponding path program 1 times [2024-10-13 06:30:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709127860] [2024-10-13 06:30:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:50,138 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-13 06:30:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:50,141 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-13 06:30:50,142 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 [2024-10-13 06:30:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:50,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:30:50,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:50,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:30:50,382 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 31 treesize of output 15 [2024-10-13 06:30:50,403 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 31 treesize of output 15 [2024-10-13 06:30:50,420 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 26 treesize of output 25 [2024-10-13 06:30:50,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:50,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 06:30:50,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:50,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:30:50,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:50,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:30:50,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:50,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-10-13 06:30:50,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:50,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 67 [2024-10-13 06:30:51,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:51,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 87 [2024-10-13 06:30:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 90 [2024-10-13 06:30:51,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:51,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 107 [2024-10-13 06:30:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 495 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 06:30:51,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:51,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709127860] [2024-10-13 06:30:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709127860] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:30:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2024-10-13 06:30:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850349836] [2024-10-13 06:30:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:30:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:30:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:30:51,733 INFO L87 Difference]: Start difference. First operand 1025 states and 1343 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:51,942 INFO L93 Difference]: Finished difference Result 1818 states and 2375 transitions. [2024-10-13 06:30:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:30:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:30:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:51,946 INFO L225 Difference]: With dead ends: 1818 [2024-10-13 06:30:51,946 INFO L226 Difference]: Without dead ends: 1011 [2024-10-13 06:30:51,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:30:51,948 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 37 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:51,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 342 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:30:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-10-13 06:30:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 847. [2024-10-13 06:30:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 743 states have (on average 1.2543741588156123) internal successors, (932), 750 states have internal predecessors, (932), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:30:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1100 transitions. [2024-10-13 06:30:51,999 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1100 transitions. Word has length 144 [2024-10-13 06:30:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1100 transitions. [2024-10-13 06:30:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1100 transitions. [2024-10-13 06:30:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:30:52,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:52,001 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:52,007 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 (18)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-13 06:30:52,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1713925174, now seen corresponding path program 1 times [2024-10-13 06:30:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500438422] [2024-10-13 06:30:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:52,206 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-13 06:30:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:52,207 INFO L229 MonitoredProcess]: Starting monitored process 19 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-13 06:30:52,209 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 (19)] Waiting until timeout for monitored process [2024-10-13 06:30:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:52,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 06:30:52,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:52,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:30:52,469 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 31 treesize of output 15 [2024-10-13 06:30:52,496 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 15 [2024-10-13 06:30:52,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-10-13 06:30:53,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:53,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 57 [2024-10-13 06:30:53,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:53,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 98 [2024-10-13 06:30:53,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:53,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 88 [2024-10-13 06:30:53,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:53,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 106 [2024-10-13 06:30:54,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:54,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 67 [2024-10-13 06:30:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 398 proven. 9 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-13 06:30:56,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:30:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:30:57,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:30:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500438422] [2024-10-13 06:30:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500438422] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:30:57,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:30:57,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [30] total 36 [2024-10-13 06:30:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823203942] [2024-10-13 06:30:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:30:57,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:30:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:30:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:30:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 06:30:57,729 INFO L87 Difference]: Start difference. First operand 847 states and 1100 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:30:59,189 INFO L93 Difference]: Finished difference Result 1884 states and 2446 transitions. [2024-10-13 06:30:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:30:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:30:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:30:59,195 INFO L225 Difference]: With dead ends: 1884 [2024-10-13 06:30:59,195 INFO L226 Difference]: Without dead ends: 1239 [2024-10-13 06:30:59,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 06:30:59,197 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 216 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:30:59,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 542 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:30:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-10-13 06:30:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1024. [2024-10-13 06:30:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 920 states have (on average 1.2695652173913043) internal successors, (1168), 927 states have internal predecessors, (1168), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:30:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1336 transitions. [2024-10-13 06:30:59,252 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1336 transitions. Word has length 144 [2024-10-13 06:30:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:30:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1336 transitions. [2024-10-13 06:30:59,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:30:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1336 transitions. [2024-10-13 06:30:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:30:59,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:30:59,254 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:30:59,261 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 (19)] Forceful destruction successful, exit code 0 [2024-10-13 06:30:59,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-13 06:30:59,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:30:59,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:30:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1320898164, now seen corresponding path program 1 times [2024-10-13 06:30:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:30:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904978028] [2024-10-13 06:30:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:30:59,456 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-13 06:30:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:30:59,457 INFO L229 MonitoredProcess]: Starting monitored process 20 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-13 06:30:59,458 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 (20)] Waiting until timeout for monitored process [2024-10-13 06:30:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:30:59,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:30:59,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:30:59,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:30:59,698 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 26 treesize of output 25 [2024-10-13 06:30:59,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:59,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-13 06:30:59,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:59,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-10-13 06:30:59,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:59,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2024-10-13 06:30:59,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:59,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 65 [2024-10-13 06:30:59,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:30:59,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 92 [2024-10-13 06:31:00,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:00,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 45 [2024-10-13 06:31:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 297 proven. 15 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 06:31:00,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:31:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:31:00,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:31:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904978028] [2024-10-13 06:31:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904978028] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:31:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:31:00,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-13 06:31:00,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731219884] [2024-10-13 06:31:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:31:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:31:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:31:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:31:00,378 INFO L87 Difference]: Start difference. First operand 1024 states and 1336 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:00,682 INFO L93 Difference]: Finished difference Result 2244 states and 2918 transitions. [2024-10-13 06:31:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:31:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:31:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:00,687 INFO L225 Difference]: With dead ends: 2244 [2024-10-13 06:31:00,688 INFO L226 Difference]: Without dead ends: 1484 [2024-10-13 06:31:00,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:31:00,690 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 74 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:00,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 291 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2024-10-13 06:31:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1333. [2024-10-13 06:31:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1207 states have (on average 1.2659486329743166) internal successors, (1528), 1216 states have internal predecessors, (1528), 100 states have call successors, (100), 25 states have call predecessors, (100), 25 states have return successors, (100), 91 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 06:31:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1728 transitions. [2024-10-13 06:31:00,773 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1728 transitions. Word has length 144 [2024-10-13 06:31:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:00,773 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1728 transitions. [2024-10-13 06:31:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1728 transitions. [2024-10-13 06:31:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:31:00,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:00,775 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:31:00,789 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 (20)] Forceful destruction successful, exit code 0 [2024-10-13 06:31:00,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-13 06:31:00,976 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2035688940, now seen corresponding path program 1 times [2024-10-13 06:31:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:31:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328988766] [2024-10-13 06:31:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:00,978 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-13 06:31:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:31:00,981 INFO L229 MonitoredProcess]: Starting monitored process 21 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-13 06:31:00,983 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 (21)] Waiting until timeout for monitored process [2024-10-13 06:31:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:01,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 06:31:01,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:31:01,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:31:01,264 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 31 treesize of output 15 [2024-10-13 06:31:01,285 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 15 [2024-10-13 06:31:01,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34 [2024-10-13 06:31:01,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 53 [2024-10-13 06:31:02,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:02,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 66 [2024-10-13 06:31:02,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:02,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 66 [2024-10-13 06:31:02,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:02,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 93 [2024-10-13 06:31:02,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:02,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 63 [2024-10-13 06:31:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 398 proven. 9 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-13 06:31:09,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:31:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:31:11,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:31:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328988766] [2024-10-13 06:31:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328988766] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:31:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:31:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [29] total 35 [2024-10-13 06:31:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560413560] [2024-10-13 06:31:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:11,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:31:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 06:31:11,477 INFO L87 Difference]: Start difference. First operand 1333 states and 1728 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:13,429 INFO L93 Difference]: Finished difference Result 2477 states and 3208 transitions. [2024-10-13 06:31:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:13,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:31:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:13,434 INFO L225 Difference]: With dead ends: 2477 [2024-10-13 06:31:13,434 INFO L226 Difference]: Without dead ends: 1484 [2024-10-13 06:31:13,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 06:31:13,436 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 207 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:13,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 587 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:31:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2024-10-13 06:31:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1285. [2024-10-13 06:31:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1158 states have (on average 1.2633851468048358) internal successors, (1463), 1167 states have internal predecessors, (1463), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 91 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 06:31:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1663 transitions. [2024-10-13 06:31:13,506 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1663 transitions. Word has length 144 [2024-10-13 06:31:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:13,506 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1663 transitions. [2024-10-13 06:31:13,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1663 transitions. [2024-10-13 06:31:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:31:13,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:13,508 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:31:13,515 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 (21)] Ended with exit code 0 [2024-10-13 06:31:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-13 06:31:13,709 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1736557428, now seen corresponding path program 1 times [2024-10-13 06:31:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:31:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639061632] [2024-10-13 06:31:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:13,710 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-13 06:31:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:31:13,713 INFO L229 MonitoredProcess]: Starting monitored process 22 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-13 06:31:13,714 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 (22)] Waiting until timeout for monitored process [2024-10-13 06:31:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:13,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:31:13,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:31:13,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:31:13,976 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 31 treesize of output 15 [2024-10-13 06:31:13,994 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 31 treesize of output 15 [2024-10-13 06:31:14,016 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 27 treesize of output 15 [2024-10-13 06:31:14,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2024-10-13 06:31:14,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:14,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 48 [2024-10-13 06:31:14,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:14,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2024-10-13 06:31:14,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:14,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 37 [2024-10-13 06:31:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 281 proven. 15 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-10-13 06:31:14,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:31:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:31:14,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:31:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639061632] [2024-10-13 06:31:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639061632] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:31:14,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:31:14,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-10-13 06:31:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998312048] [2024-10-13 06:31:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:31:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:31:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:31:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:31:14,366 INFO L87 Difference]: Start difference. First operand 1285 states and 1663 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:14,714 INFO L93 Difference]: Finished difference Result 2323 states and 3008 transitions. [2024-10-13 06:31:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:31:14,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:31:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:14,721 INFO L225 Difference]: With dead ends: 2323 [2024-10-13 06:31:14,722 INFO L226 Difference]: Without dead ends: 1372 [2024-10-13 06:31:14,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:31:14,725 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 124 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:14,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 397 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-13 06:31:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1151. [2024-10-13 06:31:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1061 states have (on average 1.2723845428840717) internal successors, (1350), 1066 states have internal predecessors, (1350), 70 states have call successors, (70), 19 states have call predecessors, (70), 19 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 06:31:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1490 transitions. [2024-10-13 06:31:14,791 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1490 transitions. Word has length 144 [2024-10-13 06:31:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:14,792 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1490 transitions. [2024-10-13 06:31:14,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:31:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1490 transitions. [2024-10-13 06:31:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:31:14,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:14,794 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:31:14,801 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 (22)] Forceful destruction successful, exit code 0 [2024-10-13 06:31:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-13 06:31:14,995 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1343530418, now seen corresponding path program 1 times [2024-10-13 06:31:14,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:31:14,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641482690] [2024-10-13 06:31:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:14,996 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-13 06:31:14,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:31:14,997 INFO L229 MonitoredProcess]: Starting monitored process 23 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-13 06:31:14,998 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 (23)] Waiting until timeout for monitored process [2024-10-13 06:31:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:15,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 06:31:15,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:31:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:31:15,327 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 26 treesize of output 25 [2024-10-13 06:31:15,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2024-10-13 06:31:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 71 [2024-10-13 06:31:17,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:17,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 70 [2024-10-13 06:31:18,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:18,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 111 [2024-10-13 06:31:18,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:18,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 104 [2024-10-13 06:31:33,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:31:33,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 122