./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:38:36,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:38:36,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:38:36,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:38:36,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:38:36,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:38:36,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:38:36,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:38:36,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:38:36,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:38:36,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:38:36,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:38:36,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:38:36,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:38:36,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:38:36,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:38:36,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:38:36,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:38:36,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:38:36,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:38:36,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:38:36,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:38:36,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:38:36,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:38:36,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:38:36,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:38:36,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:38:36,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:38:36,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:38:36,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:38:36,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:38:36,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:38:36,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:38:36,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:38:36,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:38:36,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:38:36,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:38:36,429 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 -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-11-12 07:38:36,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:38:36,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:38:36,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:38:36,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:38:36,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:38:36,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:38:37,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:38:38,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:38:38,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:38:38,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d42636c/f49f1d4f2c074793b65a7c7b358a0fa1/FLAGbd316c21c [2024-11-12 07:38:38,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d42636c/f49f1d4f2c074793b65a7c7b358a0fa1 [2024-11-12 07:38:38,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:38:38,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:38:38,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:38:38,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:38:38,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:38:38,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7377502b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38, skipping insertion in model container [2024-11-12 07:38:38,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:38:38,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-11-12 07:38:38,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:38:38,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:38:38,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-11-12 07:38:38,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:38:38,424 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:38:38,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38 WrapperNode [2024-11-12 07:38:38,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:38:38,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:38:38,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:38:38,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:38:38,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,473 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2024-11-12 07:38:38,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:38:38,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:38:38,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:38:38,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:38:38,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,496 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:38:38,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:38:38,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:38:38,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:38:38,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:38:38,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (1/1) ... [2024-11-12 07:38:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:38:38,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:38:38,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:38:38,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:38:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:38:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:38:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:38:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:38:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:38:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:38:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:38:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:38:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:38:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:38:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:38:38,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:38:38,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:38:38,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:38:39,176 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-12 07:38:39,178 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:38:39,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:38:39,192 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:38:39,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:39 BoogieIcfgContainer [2024-11-12 07:38:39,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:38:39,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:38:39,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:38:39,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:38:39,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:38:38" (1/3) ... [2024-11-12 07:38:39,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a31bb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:38:39, skipping insertion in model container [2024-11-12 07:38:39,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:38" (2/3) ... [2024-11-12 07:38:39,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a31bb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:38:39, skipping insertion in model container [2024-11-12 07:38:39,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:39" (3/3) ... [2024-11-12 07:38:39,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:38:39,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:38:39,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:38:39,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:38:39,255 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;@48bac9a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:38:39,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:38:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:38:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:38:39,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:39,266 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:39,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 430417907, now seen corresponding path program 1 times [2024-11-12 07:38:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963952994] [2024-11-12 07:38:39,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:39,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963952994] [2024-11-12 07:38:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963952994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:39,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:38:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041143991] [2024-11-12 07:38:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:38:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:38:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:38:39,622 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:39,645 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-12 07:38:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:38:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-12 07:38:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:39,655 INFO L225 Difference]: With dead ends: 201 [2024-11-12 07:38:39,655 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:38:39,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:38:39,661 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:39,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:38:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:38:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 07:38:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:38:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-12 07:38:39,695 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-12 07:38:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:39,696 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-12 07:38:39,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-12 07:38:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:38:39,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:39,699 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:39,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:38:39,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1747627975, now seen corresponding path program 1 times [2024-11-12 07:38:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385543114] [2024-11-12 07:38:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385543114] [2024-11-12 07:38:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385543114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:38:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000063157] [2024-11-12 07:38:40,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:40,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:38:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:38:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:38:40,012 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:40,042 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2024-11-12 07:38:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:38:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-12 07:38:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:40,044 INFO L225 Difference]: With dead ends: 199 [2024-11-12 07:38:40,044 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 07:38:40,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:38:40,048 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:40,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:38:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 07:38:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-12 07:38:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:38:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-12 07:38:40,057 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2024-11-12 07:38:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:40,059 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-12 07:38:40,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-12 07:38:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:38:40,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:40,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:38:40,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:40,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1143937423, now seen corresponding path program 1 times [2024-11-12 07:38:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684660989] [2024-11-12 07:38:40,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:40,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684660989] [2024-11-12 07:38:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684660989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:40,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:40,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:38:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091186681] [2024-11-12 07:38:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:40,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:38:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:38:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:38:40,272 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:40,315 INFO L93 Difference]: Finished difference Result 245 states and 361 transitions. [2024-11-12 07:38:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:38:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-12 07:38:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:40,319 INFO L225 Difference]: With dead ends: 245 [2024-11-12 07:38:40,319 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 07:38:40,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:38:40,320 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:38:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 07:38:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2024-11-12 07:38:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:38:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-11-12 07:38:40,336 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 103 [2024-11-12 07:38:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:40,337 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-11-12 07:38:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-11-12 07:38:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:38:40,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:40,339 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:38:40,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -861740552, now seen corresponding path program 1 times [2024-11-12 07:38:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:40,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074494155] [2024-11-12 07:38:40,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074494155] [2024-11-12 07:38:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074494155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:38:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948134302] [2024-11-12 07:38:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:41,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:38:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:38:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:41,742 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:42,308 INFO L93 Difference]: Finished difference Result 297 states and 435 transitions. [2024-11-12 07:38:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:38:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-12 07:38:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:42,311 INFO L225 Difference]: With dead ends: 297 [2024-11-12 07:38:42,313 INFO L226 Difference]: Without dead ends: 181 [2024-11-12 07:38:42,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:38:42,314 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:42,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 780 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:38:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-12 07:38:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-12 07:38:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.434782608695652) internal successors, (231), 162 states have internal predecessors, (231), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:38:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-11-12 07:38:42,337 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 103 [2024-11-12 07:38:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-11-12 07:38:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-11-12 07:38:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:38:42,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:42,342 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:42,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:38:42,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:42,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1680808867, now seen corresponding path program 1 times [2024-11-12 07:38:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386024793] [2024-11-12 07:38:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:38:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129205491] [2024-11-12 07:38:42,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:38:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:38:42,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:38:42,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:38:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:38:42,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:38:42,828 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 61 treesize of output 60 [2024-11-12 07:38:42,947 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 92 treesize of output 78 [2024-11-12 07:38:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:43,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:38:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:43,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386024793] [2024-11-12 07:38:43,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:38:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129205491] [2024-11-12 07:38:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129205491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:43,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:43,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:38:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179246540] [2024-11-12 07:38:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:38:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:38:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:38:43,073 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:44,090 INFO L93 Difference]: Finished difference Result 493 states and 722 transitions. [2024-11-12 07:38:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:38:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-12 07:38:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:44,093 INFO L225 Difference]: With dead ends: 493 [2024-11-12 07:38:44,093 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 07:38:44,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:38:44,095 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 97 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:44,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 355 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:38:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 07:38:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 249. [2024-11-12 07:38:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.4200913242009132) internal successors, (311), 220 states have internal predecessors, (311), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2024-11-12 07:38:44,112 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 105 [2024-11-12 07:38:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2024-11-12 07:38:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:38:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2024-11-12 07:38:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:38:44,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:44,116 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:44,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:38:44,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:38:44,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:44,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 758996857, now seen corresponding path program 1 times [2024-11-12 07:38:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231007355] [2024-11-12 07:38:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:45,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:45,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231007355] [2024-11-12 07:38:45,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231007355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:38:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023510843] [2024-11-12 07:38:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:45,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:38:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:38:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:38:45,386 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 07:38:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:45,934 INFO L93 Difference]: Finished difference Result 578 states and 837 transitions. [2024-11-12 07:38:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:38:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2024-11-12 07:38:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:45,936 INFO L225 Difference]: With dead ends: 578 [2024-11-12 07:38:45,936 INFO L226 Difference]: Without dead ends: 399 [2024-11-12 07:38:45,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:45,937 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 82 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:45,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 703 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:38:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-12 07:38:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 310. [2024-11-12 07:38:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 279 states have (on average 1.4336917562724014) internal successors, (400), 280 states have internal predecessors, (400), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 452 transitions. [2024-11-12 07:38:45,951 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 452 transitions. Word has length 106 [2024-11-12 07:38:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:45,951 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 452 transitions. [2024-11-12 07:38:45,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 07:38:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 452 transitions. [2024-11-12 07:38:45,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:38:45,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:45,952 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:45,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:38:45,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:45,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1181698683, now seen corresponding path program 1 times [2024-11-12 07:38:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160286131] [2024-11-12 07:38:45,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:47,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160286131] [2024-11-12 07:38:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160286131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:47,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:47,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:38:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541070776] [2024-11-12 07:38:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:47,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:38:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:38:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:38:47,093 INFO L87 Difference]: Start difference. First operand 310 states and 452 transitions. Second operand has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 07:38:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:47,806 INFO L93 Difference]: Finished difference Result 612 states and 887 transitions. [2024-11-12 07:38:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:38:47,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2024-11-12 07:38:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:47,809 INFO L225 Difference]: With dead ends: 612 [2024-11-12 07:38:47,809 INFO L226 Difference]: Without dead ends: 403 [2024-11-12 07:38:47,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:47,810 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 77 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:47,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 593 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:38:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-12 07:38:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 315. [2024-11-12 07:38:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 284 states have (on average 1.4295774647887325) internal successors, (406), 285 states have internal predecessors, (406), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 458 transitions. [2024-11-12 07:38:47,824 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 458 transitions. Word has length 106 [2024-11-12 07:38:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 458 transitions. [2024-11-12 07:38:47,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 9.8) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 07:38:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 458 transitions. [2024-11-12 07:38:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:38:47,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:47,826 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:47,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:38:47,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1882763261, now seen corresponding path program 1 times [2024-11-12 07:38:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408351771] [2024-11-12 07:38:47,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408351771] [2024-11-12 07:38:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408351771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:48,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:38:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618960465] [2024-11-12 07:38:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:48,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:38:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:38:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:38:48,996 INFO L87 Difference]: Start difference. First operand 315 states and 458 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:49,745 INFO L93 Difference]: Finished difference Result 683 states and 999 transitions. [2024-11-12 07:38:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:38:49,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-12 07:38:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:49,747 INFO L225 Difference]: With dead ends: 683 [2024-11-12 07:38:49,747 INFO L226 Difference]: Without dead ends: 474 [2024-11-12 07:38:49,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:38:49,749 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:49,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 844 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:38:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-12 07:38:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 423. [2024-11-12 07:38:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 392 states have (on average 1.4540816326530612) internal successors, (570), 393 states have internal predecessors, (570), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2024-11-12 07:38:49,777 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 106 [2024-11-12 07:38:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2024-11-12 07:38:49,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2024-11-12 07:38:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:38:49,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:49,778 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:49,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:38:49,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:49,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:49,779 INFO L85 PathProgramCache]: Analyzing trace with hash -180617415, now seen corresponding path program 1 times [2024-11-12 07:38:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352263354] [2024-11-12 07:38:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352263354] [2024-11-12 07:38:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352263354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:50,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:38:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032820320] [2024-11-12 07:38:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:50,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:38:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:38:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:50,861 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:51,528 INFO L93 Difference]: Finished difference Result 731 states and 1075 transitions. [2024-11-12 07:38:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:38:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-12 07:38:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:51,533 INFO L225 Difference]: With dead ends: 731 [2024-11-12 07:38:51,533 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 07:38:51,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:38:51,535 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:51,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 731 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:38:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 07:38:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 425. [2024-11-12 07:38:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 394 states have (on average 1.4517766497461928) internal successors, (572), 395 states have internal predecessors, (572), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2024-11-12 07:38:51,549 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 108 [2024-11-12 07:38:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:51,550 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2024-11-12 07:38:51,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2024-11-12 07:38:51,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:38:51,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:51,552 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:38:51,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1680078857, now seen corresponding path program 1 times [2024-11-12 07:38:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726896046] [2024-11-12 07:38:51,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726896046] [2024-11-12 07:38:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726896046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:38:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654464468] [2024-11-12 07:38:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:38:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:38:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:38:52,057 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:52,453 INFO L93 Difference]: Finished difference Result 779 states and 1141 transitions. [2024-11-12 07:38:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:38:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-12 07:38:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:52,456 INFO L225 Difference]: With dead ends: 779 [2024-11-12 07:38:52,456 INFO L226 Difference]: Without dead ends: 484 [2024-11-12 07:38:52,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:38:52,457 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:52,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 510 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:38:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-12 07:38:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 425. [2024-11-12 07:38:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 394 states have (on average 1.4467005076142132) internal successors, (570), 395 states have internal predecessors, (570), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 622 transitions. [2024-11-12 07:38:52,471 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 622 transitions. Word has length 108 [2024-11-12 07:38:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:52,471 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 622 transitions. [2024-11-12 07:38:52,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 622 transitions. [2024-11-12 07:38:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:38:52,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:52,472 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:52,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:38:52,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:52,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1257377031, now seen corresponding path program 1 times [2024-11-12 07:38:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976370022] [2024-11-12 07:38:52,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976370022] [2024-11-12 07:38:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976370022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:38:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344266522] [2024-11-12 07:38:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:38:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:38:53,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:53,354 INFO L87 Difference]: Start difference. First operand 425 states and 622 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:54,077 INFO L93 Difference]: Finished difference Result 743 states and 1088 transitions. [2024-11-12 07:38:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:38:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-12 07:38:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:54,079 INFO L225 Difference]: With dead ends: 743 [2024-11-12 07:38:54,079 INFO L226 Difference]: Without dead ends: 474 [2024-11-12 07:38:54,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:38:54,080 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 64 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:54,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 918 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:38:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-12 07:38:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 427. [2024-11-12 07:38:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 396 states have (on average 1.4444444444444444) internal successors, (572), 397 states have internal predecessors, (572), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:38:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 624 transitions. [2024-11-12 07:38:54,093 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 624 transitions. Word has length 108 [2024-11-12 07:38:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:54,093 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 624 transitions. [2024-11-12 07:38:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 624 transitions. [2024-11-12 07:38:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:38:54,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:54,095 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:54,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:38:54,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1938365222, now seen corresponding path program 1 times [2024-11-12 07:38:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:54,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429340542] [2024-11-12 07:38:54,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429340542] [2024-11-12 07:38:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429340542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:38:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132918643] [2024-11-12 07:38:54,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:54,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:38:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:54,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:38:54,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:54,838 INFO L87 Difference]: Start difference. First operand 427 states and 624 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:55,560 INFO L93 Difference]: Finished difference Result 801 states and 1156 transitions. [2024-11-12 07:38:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:38:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-12 07:38:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:55,563 INFO L225 Difference]: With dead ends: 801 [2024-11-12 07:38:55,563 INFO L226 Difference]: Without dead ends: 526 [2024-11-12 07:38:55,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:38:55,565 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 205 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:55,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 841 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:38:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-12 07:38:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 479. [2024-11-12 07:38:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 442 states have (on average 1.420814479638009) internal successors, (628), 444 states have internal predecessors, (628), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:38:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 688 transitions. [2024-11-12 07:38:55,583 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 688 transitions. Word has length 109 [2024-11-12 07:38:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:55,584 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 688 transitions. [2024-11-12 07:38:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 688 transitions. [2024-11-12 07:38:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:38:55,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:55,585 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:55,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:38:55,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:55,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1506571061, now seen corresponding path program 1 times [2024-11-12 07:38:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147254920] [2024-11-12 07:38:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147254920] [2024-11-12 07:38:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147254920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 07:38:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178890716] [2024-11-12 07:38:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:38:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:38:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:38:56,363 INFO L87 Difference]: Start difference. First operand 479 states and 688 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:57,242 INFO L93 Difference]: Finished difference Result 989 states and 1405 transitions. [2024-11-12 07:38:57,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:38:57,243 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-12 07:38:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:57,245 INFO L225 Difference]: With dead ends: 989 [2024-11-12 07:38:57,245 INFO L226 Difference]: Without dead ends: 666 [2024-11-12 07:38:57,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:38:57,246 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 94 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:57,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1895 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:38:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-12 07:38:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 651. [2024-11-12 07:38:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 600 states have (on average 1.4033333333333333) internal successors, (842), 604 states have internal predecessors, (842), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:38:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 922 transitions. [2024-11-12 07:38:57,276 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 922 transitions. Word has length 110 [2024-11-12 07:38:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:57,276 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 922 transitions. [2024-11-12 07:38:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 922 transitions. [2024-11-12 07:38:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:38:57,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:57,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:57,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:38:57,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:57,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:57,278 INFO L85 PathProgramCache]: Analyzing trace with hash 805506483, now seen corresponding path program 1 times [2024-11-12 07:38:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:57,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935109055] [2024-11-12 07:38:57,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935109055] [2024-11-12 07:38:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935109055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:38:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329456529] [2024-11-12 07:38:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:38:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:38:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:38:57,861 INFO L87 Difference]: Start difference. First operand 651 states and 922 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:58,189 INFO L93 Difference]: Finished difference Result 1312 states and 1846 transitions. [2024-11-12 07:38:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:38:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-12 07:38:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:58,193 INFO L225 Difference]: With dead ends: 1312 [2024-11-12 07:38:58,193 INFO L226 Difference]: Without dead ends: 843 [2024-11-12 07:38:58,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:38:58,195 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 54 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:58,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 505 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:38:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-12 07:38:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 657. [2024-11-12 07:38:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 606 states have (on average 1.4059405940594059) internal successors, (852), 610 states have internal predecessors, (852), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:38:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 932 transitions. [2024-11-12 07:38:58,225 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 932 transitions. Word has length 110 [2024-11-12 07:38:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 932 transitions. [2024-11-12 07:38:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:38:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 932 transitions. [2024-11-12 07:38:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:38:58,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:58,227 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:58,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:38:58,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:58,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 74174475, now seen corresponding path program 1 times [2024-11-12 07:38:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423288218] [2024-11-12 07:38:58,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:38:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:38:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:38:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:38:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:38:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:38:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:38:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:38:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423288218] [2024-11-12 07:38:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423288218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:38:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317026949] [2024-11-12 07:38:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:38:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:38:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:38:58,944 INFO L87 Difference]: Start difference. First operand 657 states and 932 transitions. Second operand has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:59,573 INFO L93 Difference]: Finished difference Result 1394 states and 1949 transitions. [2024-11-12 07:38:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:38:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-12 07:38:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:59,577 INFO L225 Difference]: With dead ends: 1394 [2024-11-12 07:38:59,577 INFO L226 Difference]: Without dead ends: 919 [2024-11-12 07:38:59,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:38:59,578 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 186 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:38:59,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 673 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:38:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-12 07:38:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 673. [2024-11-12 07:38:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 621 states have (on average 1.396135265700483) internal successors, (867), 625 states have internal predecessors, (867), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:38:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 947 transitions. [2024-11-12 07:38:59,607 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 947 transitions. Word has length 111 [2024-11-12 07:38:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:59,607 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 947 transitions. [2024-11-12 07:38:59,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:38:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 947 transitions. [2024-11-12 07:38:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:38:59,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:59,608 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:38:59,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:38:59,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash -626890103, now seen corresponding path program 1 times [2024-11-12 07:38:59,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:59,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474847068] [2024-11-12 07:38:59,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:39:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474847068] [2024-11-12 07:39:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474847068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:01,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:39:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491368720] [2024-11-12 07:39:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:01,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:39:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:39:01,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:39:01,009 INFO L87 Difference]: Start difference. First operand 673 states and 947 transitions. Second operand has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 07:39:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:01,963 INFO L93 Difference]: Finished difference Result 1207 states and 1695 transitions. [2024-11-12 07:39:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:39:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) Word has length 111 [2024-11-12 07:39:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:01,966 INFO L225 Difference]: With dead ends: 1207 [2024-11-12 07:39:01,966 INFO L226 Difference]: Without dead ends: 720 [2024-11-12 07:39:01,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:39:01,969 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 63 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:01,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 980 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:39:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-12 07:39:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 673. [2024-11-12 07:39:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 621 states have (on average 1.392914653784219) internal successors, (865), 625 states have internal predecessors, (865), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:39:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 945 transitions. [2024-11-12 07:39:01,996 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 945 transitions. Word has length 111 [2024-11-12 07:39:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:01,996 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 945 transitions. [2024-11-12 07:39:01,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 7.714285714285714) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 07:39:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 945 transitions. [2024-11-12 07:39:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:01,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:01,998 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:39:01,998 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:01,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -512631539, now seen corresponding path program 1 times [2024-11-12 07:39:01,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949527763] [2024-11-12 07:39:01,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:39:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949527763] [2024-11-12 07:39:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949527763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:03,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:39:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476493426] [2024-11-12 07:39:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:39:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:39:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:03,387 INFO L87 Difference]: Start difference. First operand 673 states and 945 transitions. Second operand has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:04,141 INFO L93 Difference]: Finished difference Result 1197 states and 1679 transitions. [2024-11-12 07:39:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:39:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 111 [2024-11-12 07:39:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:04,145 INFO L225 Difference]: With dead ends: 1197 [2024-11-12 07:39:04,145 INFO L226 Difference]: Without dead ends: 710 [2024-11-12 07:39:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:39:04,146 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 60 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:04,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 913 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:39:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-12 07:39:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 671. [2024-11-12 07:39:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 619 states have (on average 1.3909531502423262) internal successors, (861), 623 states have internal predecessors, (861), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:39:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 941 transitions. [2024-11-12 07:39:04,175 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 941 transitions. Word has length 111 [2024-11-12 07:39:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:04,175 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 941 transitions. [2024-11-12 07:39:04,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 941 transitions. [2024-11-12 07:39:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:04,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:04,177 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:04,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:39:04,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:04,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -298454379, now seen corresponding path program 1 times [2024-11-12 07:39:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800342373] [2024-11-12 07:39:04,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:39:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800342373] [2024-11-12 07:39:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800342373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:05,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:39:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659899155] [2024-11-12 07:39:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:05,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:39:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:39:05,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:05,271 INFO L87 Difference]: Start difference. First operand 671 states and 941 transitions. Second operand has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:06,017 INFO L93 Difference]: Finished difference Result 1193 states and 1671 transitions. [2024-11-12 07:39:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:39:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 111 [2024-11-12 07:39:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:06,020 INFO L225 Difference]: With dead ends: 1193 [2024-11-12 07:39:06,020 INFO L226 Difference]: Without dead ends: 708 [2024-11-12 07:39:06,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:39:06,021 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 67 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:06,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 994 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:39:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-12 07:39:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 671. [2024-11-12 07:39:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 619 states have (on average 1.384491114701131) internal successors, (857), 623 states have internal predecessors, (857), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:39:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 937 transitions. [2024-11-12 07:39:06,048 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 937 transitions. Word has length 111 [2024-11-12 07:39:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:06,048 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 937 transitions. [2024-11-12 07:39:06,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 7.714285714285714) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 937 transitions. [2024-11-12 07:39:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:06,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:06,050 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:39:06,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:06,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash 402610199, now seen corresponding path program 1 times [2024-11-12 07:39:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795558425] [2024-11-12 07:39:06,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:39:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795558425] [2024-11-12 07:39:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795558425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:39:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195939342] [2024-11-12 07:39:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:39:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:06,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:39:06,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:39:06,985 INFO L87 Difference]: Start difference. First operand 671 states and 937 transitions. Second operand has 10 states, 6 states have (on average 9.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:07,632 INFO L93 Difference]: Finished difference Result 1146 states and 1598 transitions. [2024-11-12 07:39:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:39:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 6 states have (on average 9.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 111 [2024-11-12 07:39:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:07,635 INFO L225 Difference]: With dead ends: 1146 [2024-11-12 07:39:07,636 INFO L226 Difference]: Without dead ends: 661 [2024-11-12 07:39:07,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:07,638 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 73 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:07,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 838 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:39:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-12 07:39:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2024-11-12 07:39:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 607 states have (on average 1.3756177924217463) internal successors, (835), 611 states have internal predecessors, (835), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:39:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 915 transitions. [2024-11-12 07:39:07,663 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 915 transitions. Word has length 111 [2024-11-12 07:39:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 915 transitions. [2024-11-12 07:39:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 6 states have (on average 9.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-12 07:39:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 915 transitions. [2024-11-12 07:39:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:07,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:07,665 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:07,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:39:07,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1861825235, now seen corresponding path program 1 times [2024-11-12 07:39:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504577625] [2024-11-12 07:39:07,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:39:07,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035554557] [2024-11-12 07:39:07,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:07,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:39:07,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:39:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:08,123 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:39:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:08,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:39:08,455 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:39:08,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:39:08,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:08,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-12 07:39:08,662 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:08,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:39:08,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:39:08 BoogieIcfgContainer [2024-11-12 07:39:08,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:39:08,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:39:08,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:39:08,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:39:08,711 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:39" (3/4) ... [2024-11-12 07:39:08,712 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:39:08,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:39:08,714 INFO L158 Benchmark]: Toolchain (without parser) took 30591.14ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 156.5MB in the beginning and 603.5MB in the end (delta: -447.1MB). Peak memory consumption was 392.8MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,714 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:39:08,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 184.5MB. Free memory was 156.5MB in the beginning and 138.5MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.25ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 134.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,715 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 130.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,715 INFO L158 Benchmark]: RCFGBuilder took 655.09ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 123.0MB in the end (delta: 7.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,718 INFO L158 Benchmark]: TraceAbstraction took 29515.37ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 121.9MB in the beginning and 604.6MB in the end (delta: -482.6MB). Peak memory consumption was 357.3MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,718 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 1.0GB. Free memory was 604.6MB in the beginning and 603.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:39:08,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.34ms. Allocated memory is still 184.5MB. Free memory was 156.5MB in the beginning and 138.5MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.25ms. Allocated memory is still 184.5MB. Free memory was 138.5MB in the beginning and 134.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 130.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 655.09ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 123.0MB in the end (delta: 7.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29515.37ms. Allocated memory was 184.5MB in the beginning and 1.0GB in the end (delta: 838.9MB). Free memory was 121.9MB in the beginning and 604.6MB in the end (delta: -482.6MB). Peak memory consumption was 357.3MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 1.0GB. Free memory was 604.6MB in the beginning and 603.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 104, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L48] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR WrapperStruct00.var_1_1 [L100] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_9 [L101] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L80] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L82] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L112] RET updateVariables() [L113] CALL step() [L52] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR WrapperStruct00.var_1_6 [L53] EXPR WrapperStruct00.var_1_7 [L53] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L53] EXPR WrapperStruct00.var_1_8 [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))) [L55] EXPR WrapperStruct00.var_1_10 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L55] EXPR WrapperStruct00.var_1_6 [L55] EXPR WrapperStruct00.var_1_8 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L55] COND FALSE !(WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) [L66] EXPR WrapperStruct00.var_1_6 [L66] WrapperStruct00.var_1_9 = WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_7 [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L68] COND FALSE !(WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) [L75] EXPR WrapperStruct00.var_1_12 [L75] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_12 [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) [L104] EXPR WrapperStruct00.var_1_10 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104-L105] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1496 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1458 mSDsluCounter, 13932 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11237 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11683 IncrementalHoareTripleChecker+Invalid, 11792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 2695 mSDtfsCounter, 11683 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 902 GetRequests, 744 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=15, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1091 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2364 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 10011 SizeOfPredicates, 3 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 5016/5016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 07:39:08,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:10,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:10,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:39:10,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:10,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:10,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:10,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:10,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:10,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:10,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:10,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:10,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:10,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:10,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:10,710 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:10,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:10,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:10,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:10,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:10,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:10,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:10,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:10,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:10,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:39:10,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:39:10,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:10,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:39:10,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:10,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:10,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:10,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:10,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:10,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:10,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:10,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:10,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:10,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:10,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:10,721 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:39:10,721 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:39:10,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:10,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:10,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:10,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:10,722 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 -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-11-12 07:39:10,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:10,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:10,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:10,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:10,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:10,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:39:12,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:12,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:12,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:39:12,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176c43a4f/78c27f2ac75b44e183c99d87645d48df/FLAGf0b28fd9e [2024-11-12 07:39:12,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176c43a4f/78c27f2ac75b44e183c99d87645d48df [2024-11-12 07:39:12,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:12,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:12,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:12,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:12,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:12,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fddc654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12, skipping insertion in model container [2024-11-12 07:39:12,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:12,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-11-12 07:39:12,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:12,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:12,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-11-12 07:39:12,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:12,763 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:12,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12 WrapperNode [2024-11-12 07:39:12,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:12,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:12,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:12,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:12,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,830 INFO L138 Inliner]: procedures = 34, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-11-12 07:39:12,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:12,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:12,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:12,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:12,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,858 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 26 writes are split as follows [0, 26]. [2024-11-12 07:39:12,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:12,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:12,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:12,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:12,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (1/1) ... [2024-11-12 07:39:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:12,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:12,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:39:12,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:39:12,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:12,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:39:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:39:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:39:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:39:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:39:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:39:13,070 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:13,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:13,599 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:13,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:13,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:13,614 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:13,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:13 BoogieIcfgContainer [2024-11-12 07:39:13,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:13,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:13,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:13,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:13,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:12" (1/3) ... [2024-11-12 07:39:13,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19118a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:13, skipping insertion in model container [2024-11-12 07:39:13,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:12" (2/3) ... [2024-11-12 07:39:13,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19118a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:13, skipping insertion in model container [2024-11-12 07:39:13,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:13" (3/3) ... [2024-11-12 07:39:13,621 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-11-12 07:39:13,633 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:13,633 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:13,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:13,679 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;@6b4cf8be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:13,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:39:13,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:13,696 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:13,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:13,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash 630230807, now seen corresponding path program 1 times [2024-11-12 07:39:13,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240192340] [2024-11-12 07:39:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:13,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:13,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:13,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:39:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:13,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:39:13,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-12 07:39:13,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:13,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240192340] [2024-11-12 07:39:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240192340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:39:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489725060] [2024-11-12 07:39:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:13,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:39:13,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:39:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:13,996 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:14,018 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-12 07:39:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:39:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-12 07:39:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:14,025 INFO L225 Difference]: With dead ends: 193 [2024-11-12 07:39:14,026 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:39:14,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:14,031 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:14,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:39:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 07:39:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-12 07:39:14,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-12 07:39:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-12 07:39:14,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-12 07:39:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:39:14,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:14,070 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:14,078 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 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:14,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:14,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:14,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1947440875, now seen corresponding path program 1 times [2024-11-12 07:39:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:14,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470101859] [2024-11-12 07:39:14,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:14,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:14,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:14,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:39:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:14,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 07:39:14,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:14,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470101859] [2024-11-12 07:39:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470101859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371487787] [2024-11-12 07:39:14,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:14,490 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:14,528 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-11-12 07:39:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-12 07:39:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:14,530 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:39:14,530 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:39:14,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:14,531 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:14,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:39:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:39:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-11-12 07:39:14,546 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 100 [2024-11-12 07:39:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:14,547 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-11-12 07:39:14,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-11-12 07:39:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:39:14,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:14,550 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:14,562 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:14,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1503520919, now seen corresponding path program 1 times [2024-11-12 07:39:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907780338] [2024-11-12 07:39:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:14,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:14,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:14,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:39:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:39:14,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:14,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:14,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907780338] [2024-11-12 07:39:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907780338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:14,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625330891] [2024-11-12 07:39:14,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:14,959 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:14,975 INFO L93 Difference]: Finished difference Result 194 states and 285 transitions. [2024-11-12 07:39:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-12 07:39:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:14,977 INFO L225 Difference]: With dead ends: 194 [2024-11-12 07:39:14,977 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:39:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:14,978 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:14,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:39:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 07:39:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-12 07:39:14,985 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 100 [2024-11-12 07:39:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:14,986 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-12 07:39:14,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-12 07:39:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:39:14,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:14,988 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:14,994 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:15,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:15,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1780329127, now seen corresponding path program 1 times [2024-11-12 07:39:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031316682] [2024-11-12 07:39:15,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:15,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:15,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:15,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:39:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:15,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:15,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:15,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031316682] [2024-11-12 07:39:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031316682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573665775] [2024-11-12 07:39:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:15,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:15,370 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:15,401 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2024-11-12 07:39:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-12 07:39:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:15,402 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:39:15,403 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:39:15,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:15,404 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:15,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:39:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 07:39:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-12 07:39:15,416 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 100 [2024-11-12 07:39:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:15,416 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-12 07:39:15,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-12 07:39:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:39:15,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:15,417 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:15,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:15,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:15,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:15,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 565363524, now seen corresponding path program 1 times [2024-11-12 07:39:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:15,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184194259] [2024-11-12 07:39:15,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:15,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:15,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:15,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:39:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:39:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:15,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:15,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:15,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184194259] [2024-11-12 07:39:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184194259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:15,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:15,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:15,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057381242] [2024-11-12 07:39:15,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:15,916 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:15,987 INFO L93 Difference]: Finished difference Result 240 states and 350 transitions. [2024-11-12 07:39:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-12 07:39:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:15,995 INFO L225 Difference]: With dead ends: 240 [2024-11-12 07:39:15,995 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:39:15,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:15,996 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:15,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:39:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:39:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2024-11-12 07:39:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:39:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-12 07:39:16,012 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 103 [2024-11-12 07:39:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:16,013 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-12 07:39:16,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-12 07:39:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 07:39:16,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:16,014 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:16,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:39:16,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:16,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1532789938, now seen corresponding path program 1 times [2024-11-12 07:39:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666554254] [2024-11-12 07:39:16,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:16,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:16,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:39:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:39:16,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:16,505 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 61 treesize of output 60 [2024-11-12 07:39:16,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 103 treesize of output 89 [2024-11-12 07:39:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:16,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:16,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666554254] [2024-11-12 07:39:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666554254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876166320] [2024-11-12 07:39:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:16,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:16,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:16,999 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:17,908 INFO L93 Difference]: Finished difference Result 328 states and 481 transitions. [2024-11-12 07:39:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:17,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-12 07:39:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:17,912 INFO L225 Difference]: With dead ends: 328 [2024-11-12 07:39:17,912 INFO L226 Difference]: Without dead ends: 214 [2024-11-12 07:39:17,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:17,913 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 91 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:17,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 337 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:39:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-12 07:39:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2024-11-12 07:39:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.4) internal successors, (217), 155 states have internal predecessors, (217), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:39:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 265 transitions. [2024-11-12 07:39:17,939 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 265 transitions. Word has length 103 [2024-11-12 07:39:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:17,940 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 265 transitions. [2024-11-12 07:39:17,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 265 transitions. [2024-11-12 07:39:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:39:17,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:17,942 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:17,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 (7)] Ended with exit code 0 [2024-11-12 07:39:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:18,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash 883165602, now seen corresponding path program 1 times [2024-11-12 07:39:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56853748] [2024-11-12 07:39:18,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:18,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:18,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:18,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:18,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:39:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:18,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 07:39:18,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:18,373 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-11-12 07:39:18,416 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-11-12 07:39:18,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,516 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 39 [2024-11-12 07:39:18,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,662 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 52 treesize of output 42 [2024-11-12 07:39:18,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,767 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 52 treesize of output 42 [2024-11-12 07:39:18,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,854 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 52 treesize of output 42 [2024-11-12 07:39:18,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,969 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 48 treesize of output 42 [2024-11-12 07:39:18,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:18,999 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 54 treesize of output 53 [2024-11-12 07:39:19,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:19,113 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 88 treesize of output 63 [2024-11-12 07:39:19,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:19,195 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 89 treesize of output 35 [2024-11-12 07:39:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:39:19,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:19,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56853748] [2024-11-12 07:39:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56853748] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-11-12 07:39:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462193579] [2024-11-12 07:39:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:39:19,433 INFO L87 Difference]: Start difference. First operand 182 states and 265 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:19,969 INFO L93 Difference]: Finished difference Result 345 states and 498 transitions. [2024-11-12 07:39:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:19,970 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-12 07:39:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:19,971 INFO L225 Difference]: With dead ends: 345 [2024-11-12 07:39:19,971 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 07:39:19,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:39:19,972 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 106 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:19,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 307 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:39:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 07:39:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2024-11-12 07:39:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3888888888888888) internal successors, (275), 199 states have internal predecessors, (275), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 327 transitions. [2024-11-12 07:39:19,983 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 327 transitions. Word has length 106 [2024-11-12 07:39:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:19,984 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 327 transitions. [2024-11-12 07:39:19,984 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 327 transitions. [2024-11-12 07:39:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 07:39:19,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:19,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:19,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:39:20,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:20,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:20,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1584230180, now seen corresponding path program 1 times [2024-11-12 07:39:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230877217] [2024-11-12 07:39:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:20,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:39:20,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:39:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:20,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 07:39:20,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:20,408 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-11-12 07:39:20,412 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-11-12 07:39:20,462 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 30 treesize of output 14 [2024-11-12 07:39:20,503 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 30 treesize of output 14 [2024-11-12 07:39:20,539 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-11-12 07:39:20,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,624 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-11-12 07:39:20,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,678 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-11-12 07:39:20,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,763 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 42 treesize of output 47 [2024-11-12 07:39:20,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,808 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 59 treesize of output 61 [2024-11-12 07:39:20,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,870 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 69 treesize of output 65 [2024-11-12 07:39:20,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:20,956 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 69 treesize of output 31 [2024-11-12 07:39:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 07:39:21,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:21,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230877217] [2024-11-12 07:39:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230877217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:39:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578035598] [2024-11-12 07:39:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:39:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:39:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:21,012 INFO L87 Difference]: Start difference. First operand 228 states and 327 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:39:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:22,576 INFO L93 Difference]: Finished difference Result 584 states and 839 transitions. [2024-11-12 07:39:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:39:22,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-12 07:39:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:22,580 INFO L225 Difference]: With dead ends: 584 [2024-11-12 07:39:22,580 INFO L226 Difference]: Without dead ends: 426 [2024-11-12 07:39:22,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:39:22,581 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 359 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:22,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 390 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 07:39:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-12 07:39:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 260. [2024-11-12 07:39:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.4) internal successors, (322), 231 states have internal predecessors, (322), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 374 transitions. [2024-11-12 07:39:22,603 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 374 transitions. Word has length 106 [2024-11-12 07:39:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 374 transitions. [2024-11-12 07:39:22,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:39:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 374 transitions. [2024-11-12 07:39:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:39:22,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:22,604 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:22,613 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 (9)] Ended with exit code 0 [2024-11-12 07:39:22,805 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-11-12 07:39:22,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 239391488, now seen corresponding path program 1 times [2024-11-12 07:39:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962413801] [2024-11-12 07:39:22,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:22,807 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-11-12 07:39:22,808 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-11-12 07:39:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 07:39:23,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:23,071 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-11-12 07:39:23,162 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 36 treesize of output 29 [2024-11-12 07:39:23,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:23,317 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-11-12 07:39:23,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:23,427 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-11-12 07:39:23,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:23,534 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-11-12 07:39:23,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:23,703 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 50 treesize of output 40 [2024-11-12 07:39:23,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:23,798 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 50 treesize of output 40 [2024-11-12 07:39:24,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:24,097 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 65 treesize of output 56 [2024-11-12 07:39:24,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:24,191 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 71 treesize of output 67 [2024-11-12 07:39:24,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:24,291 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 81 treesize of output 71 [2024-11-12 07:39:24,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:24,460 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 83 treesize of output 35 [2024-11-12 07:39:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-12 07:39:24,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:24,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:24,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962413801] [2024-11-12 07:39:24,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962413801] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:24,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:24,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-11-12 07:39:24,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933809277] [2024-11-12 07:39:24,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:24,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:39:24,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:24,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:39:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:39:24,691 INFO L87 Difference]: Start difference. First operand 260 states and 374 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:25,238 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2024-11-12 07:39:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:39:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-12 07:39:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:25,242 INFO L225 Difference]: With dead ends: 569 [2024-11-12 07:39:25,242 INFO L226 Difference]: Without dead ends: 392 [2024-11-12 07:39:25,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:39:25,243 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 193 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:25,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 430 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:39:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-12 07:39:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 326. [2024-11-12 07:39:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 296 states have (on average 1.4189189189189189) internal successors, (420), 297 states have internal predecessors, (420), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 472 transitions. [2024-11-12 07:39:25,264 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 472 transitions. Word has length 108 [2024-11-12 07:39:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:25,265 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 472 transitions. [2024-11-12 07:39:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 472 transitions. [2024-11-12 07:39:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:39:25,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:25,266 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:25,274 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 (10)] Ended with exit code 0 [2024-11-12 07:39:25,466 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-11-12 07:39:25,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:25,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1233591454, now seen corresponding path program 1 times [2024-11-12 07:39:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:25,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564940245] [2024-11-12 07:39:25,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:25,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:25,468 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-11-12 07:39:25,469 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-11-12 07:39:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:39:25,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:25,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:25,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564940245] [2024-11-12 07:39:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564940245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:25,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342439589] [2024-11-12 07:39:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:25,724 INFO L87 Difference]: Start difference. First operand 326 states and 472 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:26,611 INFO L93 Difference]: Finished difference Result 688 states and 995 transitions. [2024-11-12 07:39:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-12 07:39:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:26,617 INFO L225 Difference]: With dead ends: 688 [2024-11-12 07:39:26,617 INFO L226 Difference]: Without dead ends: 454 [2024-11-12 07:39:26,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:26,618 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 75 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:26,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 316 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:39:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-12 07:39:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 363. [2024-11-12 07:39:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 333 states have (on average 1.4324324324324325) internal successors, (477), 334 states have internal predecessors, (477), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 529 transitions. [2024-11-12 07:39:26,631 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 529 transitions. Word has length 108 [2024-11-12 07:39:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:26,632 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 529 transitions. [2024-11-12 07:39:26,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 529 transitions. [2024-11-12 07:39:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:39:26,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:26,633 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:26,639 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-11-12 07:39:26,833 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-11-12 07:39:26,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:26,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1656293280, now seen corresponding path program 1 times [2024-11-12 07:39:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800291687] [2024-11-12 07:39:26,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:26,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-11-12 07:39:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:26,837 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-11-12 07:39:26,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 (12)] Waiting until timeout for monitored process [2024-11-12 07:39:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 07:39:27,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:27,049 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-11-12 07:39:27,127 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 36 treesize of output 29 [2024-11-12 07:39:27,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:27,211 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 46 treesize of output 42 [2024-11-12 07:39:27,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:27,361 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-11-12 07:39:27,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:27,541 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 55 treesize of output 63 [2024-11-12 07:39:27,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:27,757 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 70 treesize of output 66 [2024-11-12 07:39:27,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:27,882 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 70 treesize of output 66 [2024-11-12 07:39:28,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:28,278 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 86 treesize of output 74 [2024-11-12 07:39:28,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:28,386 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 85 [2024-11-12 07:39:28,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:28,515 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 107 treesize of output 88 [2024-11-12 07:39:28,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:28,712 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 109 treesize of output 43 [2024-11-12 07:39:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 197 proven. 30 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-12 07:39:28,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:28,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800291687] [2024-11-12 07:39:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800291687] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-12 07:39:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767611568] [2024-11-12 07:39:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:28,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:39:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:28,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:39:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:39:28,992 INFO L87 Difference]: Start difference. First operand 363 states and 529 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:29,652 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2024-11-12 07:39:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:39:29,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-12 07:39:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:29,655 INFO L225 Difference]: With dead ends: 635 [2024-11-12 07:39:29,655 INFO L226 Difference]: Without dead ends: 403 [2024-11-12 07:39:29,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:39:29,656 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 126 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:29,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 536 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:39:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-12 07:39:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 369. [2024-11-12 07:39:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 339 states have (on average 1.4277286135693215) internal successors, (484), 340 states have internal predecessors, (484), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2024-11-12 07:39:29,671 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 108 [2024-11-12 07:39:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:29,671 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2024-11-12 07:39:29,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2024-11-12 07:39:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:39:29,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:29,672 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:29,681 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 (12)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:29,873 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-11-12 07:39:29,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:29,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2044829822, now seen corresponding path program 1 times [2024-11-12 07:39:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642737103] [2024-11-12 07:39:29,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:29,877 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-11-12 07:39:29,878 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-11-12 07:39:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:30,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 07:39:30,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:30,100 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-11-12 07:39:30,138 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-11-12 07:39:30,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,212 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 42 treesize of output 29 [2024-11-12 07:39:30,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,259 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 42 treesize of output 29 [2024-11-12 07:39:30,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,302 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 42 treesize of output 29 [2024-11-12 07:39:30,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,339 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 42 treesize of output 29 [2024-11-12 07:39:30,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,459 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 61 treesize of output 40 [2024-11-12 07:39:30,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,487 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 67 treesize of output 51 [2024-11-12 07:39:30,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:30,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 83 treesize of output 35 [2024-11-12 07:39:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:39:30,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:30,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642737103] [2024-11-12 07:39:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642737103] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-12 07:39:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577828786] [2024-11-12 07:39:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:39:30,708 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:31,089 INFO L93 Difference]: Finished difference Result 639 states and 925 transitions. [2024-11-12 07:39:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-12 07:39:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:31,093 INFO L225 Difference]: With dead ends: 639 [2024-11-12 07:39:31,093 INFO L226 Difference]: Without dead ends: 399 [2024-11-12 07:39:31,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:39:31,094 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 148 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:31,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 381 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-12 07:39:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 355. [2024-11-12 07:39:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 324 states have (on average 1.4166666666666667) internal successors, (459), 325 states have internal predecessors, (459), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 511 transitions. [2024-11-12 07:39:31,113 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 511 transitions. Word has length 108 [2024-11-12 07:39:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:31,114 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 511 transitions. [2024-11-12 07:39:31,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 511 transitions. [2024-11-12 07:39:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:39:31,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:31,115 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:31,123 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-11-12 07:39:31,315 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-11-12 07:39:31,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:31,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -47777376, now seen corresponding path program 1 times [2024-11-12 07:39:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042441881] [2024-11-12 07:39:31,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:31,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:31,318 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-11-12 07:39:31,318 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-11-12 07:39:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:31,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 07:39:31,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:31,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 19 treesize of output 1 [2024-11-12 07:39:31,543 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-11-12 07:39:31,545 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-11-12 07:39:31,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 30 treesize of output 14 [2024-11-12 07:39:31,598 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-11-12 07:39:31,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,659 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-11-12 07:39:31,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,694 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-11-12 07:39:31,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,773 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 42 treesize of output 47 [2024-11-12 07:39:31,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,834 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 52 treesize of output 60 [2024-11-12 07:39:31,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,887 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 63 [2024-11-12 07:39:31,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:31,957 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 67 treesize of output 29 [2024-11-12 07:39:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:39:32,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:32,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042441881] [2024-11-12 07:39:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042441881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:39:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356054417] [2024-11-12 07:39:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:39:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:39:32,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:32,010 INFO L87 Difference]: Start difference. First operand 355 states and 511 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:39:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:33,753 INFO L93 Difference]: Finished difference Result 713 states and 1028 transitions. [2024-11-12 07:39:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:39:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-12 07:39:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:33,756 INFO L225 Difference]: With dead ends: 713 [2024-11-12 07:39:33,756 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 07:39:33,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:39:33,757 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 271 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:33,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 528 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 07:39:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 07:39:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 363. [2024-11-12 07:39:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 332 states have (on average 1.4186746987951808) internal successors, (471), 333 states have internal predecessors, (471), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 523 transitions. [2024-11-12 07:39:33,771 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 523 transitions. Word has length 109 [2024-11-12 07:39:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 523 transitions. [2024-11-12 07:39:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 07:39:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 523 transitions. [2024-11-12 07:39:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:39:33,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:33,772 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:33,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 07:39:33,973 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-11-12 07:39:33,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash 704582421, now seen corresponding path program 1 times [2024-11-12 07:39:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517518449] [2024-11-12 07:39:33,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:33,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:33,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:33,978 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-11-12 07:39:33,979 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-11-12 07:39:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:34,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 07:39:34,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:34,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:39:34,234 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-11-12 07:39:34,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,381 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-11-12 07:39:34,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,496 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-11-12 07:39:34,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,597 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-11-12 07:39:34,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,675 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-11-12 07:39:34,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,779 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 47 treesize of output 41 [2024-11-12 07:39:34,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,806 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 53 treesize of output 52 [2024-11-12 07:39:34,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:34,941 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 62 [2024-11-12 07:39:35,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:35,135 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 116 treesize of output 50 [2024-11-12 07:39:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 155 proven. 42 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 07:39:35,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:35,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517518449] [2024-11-12 07:39:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517518449] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 22 [2024-11-12 07:39:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511136051] [2024-11-12 07:39:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:35,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:39:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:39:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:39:35,375 INFO L87 Difference]: Start difference. First operand 363 states and 523 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:35,990 INFO L93 Difference]: Finished difference Result 753 states and 1080 transitions. [2024-11-12 07:39:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:39:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-12 07:39:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:35,993 INFO L225 Difference]: With dead ends: 753 [2024-11-12 07:39:35,993 INFO L226 Difference]: Without dead ends: 527 [2024-11-12 07:39:35,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:39:35,994 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 68 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:35,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 617 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:39:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-12 07:39:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 457. [2024-11-12 07:39:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 426 states have (on average 1.4178403755868545) internal successors, (604), 427 states have internal predecessors, (604), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 656 transitions. [2024-11-12 07:39:36,013 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 656 transitions. Word has length 109 [2024-11-12 07:39:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:36,014 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 656 transitions. [2024-11-12 07:39:36,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 656 transitions. [2024-11-12 07:39:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:39:36,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:36,014 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:36,026 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-11-12 07:39:36,215 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-11-12 07:39:36,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:36,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1254496272, now seen corresponding path program 1 times [2024-11-12 07:39:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089204891] [2024-11-12 07:39:36,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:36,217 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-11-12 07:39:36,218 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-11-12 07:39:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:36,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 07:39:36,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:36,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 85 treesize of output 37 [2024-11-12 07:39:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:36,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:36,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089204891] [2024-11-12 07:39:36,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089204891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144273484] [2024-11-12 07:39:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:36,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:36,479 INFO L87 Difference]: Start difference. First operand 457 states and 656 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:36,822 INFO L93 Difference]: Finished difference Result 751 states and 1090 transitions. [2024-11-12 07:39:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:36,823 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-12 07:39:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:36,825 INFO L225 Difference]: With dead ends: 751 [2024-11-12 07:39:36,825 INFO L226 Difference]: Without dead ends: 463 [2024-11-12 07:39:36,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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-11-12 07:39:36,826 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:36,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-12 07:39:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-11-12 07:39:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 432 states have (on average 1.4212962962962963) internal successors, (614), 433 states have internal predecessors, (614), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 666 transitions. [2024-11-12 07:39:36,839 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 666 transitions. Word has length 109 [2024-11-12 07:39:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:36,839 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 666 transitions. [2024-11-12 07:39:36,839 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 666 transitions. [2024-11-12 07:39:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:39:36,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:36,840 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:36,848 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-11-12 07:39:37,041 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-11-12 07:39:37,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 553431694, now seen corresponding path program 1 times [2024-11-12 07:39:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664090278] [2024-11-12 07:39:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:37,043 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-11-12 07:39:37,044 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-11-12 07:39:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:37,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 07:39:37,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:37,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:39:37,325 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-11-12 07:39:37,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,477 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 52 treesize of output 33 [2024-11-12 07:39:37,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,545 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-11-12 07:39:37,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,686 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-11-12 07:39:37,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,757 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-11-12 07:39:37,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,880 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 47 treesize of output 41 [2024-11-12 07:39:37,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,912 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 53 treesize of output 52 [2024-11-12 07:39:37,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:37,973 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 69 treesize of output 27 [2024-11-12 07:39:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 187 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-12 07:39:38,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-12 07:39:38,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:38,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664090278] [2024-11-12 07:39:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664090278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:39:38,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:39:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-12 07:39:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565250402] [2024-11-12 07:39:38,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:39:38,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 07:39:38,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:38,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 07:39:38,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:39:38,380 INFO L87 Difference]: Start difference. First operand 463 states and 666 transitions. Second operand has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-12 07:39:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:40,296 INFO L93 Difference]: Finished difference Result 859 states and 1201 transitions. [2024-11-12 07:39:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 07:39:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) Word has length 109 [2024-11-12 07:39:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:40,299 INFO L225 Difference]: With dead ends: 859 [2024-11-12 07:39:40,299 INFO L226 Difference]: Without dead ends: 557 [2024-11-12 07:39:40,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=471, Invalid=1599, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 07:39:40,300 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 364 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:40,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 458 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 07:39:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-12 07:39:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 495. [2024-11-12 07:39:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 456 states have (on average 1.3793859649122806) internal successors, (629), 457 states have internal predecessors, (629), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 681 transitions. [2024-11-12 07:39:40,319 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 681 transitions. Word has length 109 [2024-11-12 07:39:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:40,320 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 681 transitions. [2024-11-12 07:39:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 5.15) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (22), 5 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-12 07:39:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 681 transitions. [2024-11-12 07:39:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:39:40,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:40,321 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:40,330 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 (17)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:40,521 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-11-12 07:39:40,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 772553852, now seen corresponding path program 1 times [2024-11-12 07:39:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907769767] [2024-11-12 07:39:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:40,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:40,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:40,524 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-11-12 07:39:40,524 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-11-12 07:39:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:40,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 07:39:40,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:40,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:39:40,745 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-11-12 07:39:40,786 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 30 treesize of output 14 [2024-11-12 07:39:40,804 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 30 treesize of output 14 [2024-11-12 07:39:40,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:40,854 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 32 treesize of output 34 [2024-11-12 07:39:40,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:40,880 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 49 treesize of output 57 [2024-11-12 07:39:40,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:40,916 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 64 treesize of output 60 [2024-11-12 07:39:40,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:40,993 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 64 treesize of output 26 [2024-11-12 07:39:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-12 07:39:41,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:41,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:41,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907769767] [2024-11-12 07:39:41,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907769767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:41,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:41,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:39:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091746091] [2024-11-12 07:39:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:41,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:39:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:39:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:39:41,066 INFO L87 Difference]: Start difference. First operand 495 states and 681 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:43,372 INFO L93 Difference]: Finished difference Result 976 states and 1345 transitions. [2024-11-12 07:39:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:39:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-12 07:39:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:43,375 INFO L225 Difference]: With dead ends: 976 [2024-11-12 07:39:43,375 INFO L226 Difference]: Without dead ends: 666 [2024-11-12 07:39:43,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:39:43,376 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 305 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:43,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 709 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:39:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-12 07:39:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 523. [2024-11-12 07:39:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 484 states have (on average 1.378099173553719) internal successors, (667), 485 states have internal predecessors, (667), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 719 transitions. [2024-11-12 07:39:43,398 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 719 transitions. Word has length 110 [2024-11-12 07:39:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:43,399 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 719 transitions. [2024-11-12 07:39:43,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:39:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 719 transitions. [2024-11-12 07:39:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:39:43,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:43,400 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:43,409 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 (18)] Ended with exit code 0 [2024-11-12 07:39:43,604 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-11-12 07:39:43,605 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:43,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash 71489274, now seen corresponding path program 1 times [2024-11-12 07:39:43,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60469127] [2024-11-12 07:39:43,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:43,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:43,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:43,607 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-11-12 07:39:43,609 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-11-12 07:39:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:43,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:39:43,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:43,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:43,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 62 treesize of output 26 [2024-11-12 07:39:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:43,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:43,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60469127] [2024-11-12 07:39:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60469127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:43,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566331822] [2024-11-12 07:39:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:43,905 INFO L87 Difference]: Start difference. First operand 523 states and 719 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:46,937 INFO L93 Difference]: Finished difference Result 902 states and 1249 transitions. [2024-11-12 07:39:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:46,940 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-12 07:39:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:46,942 INFO L225 Difference]: With dead ends: 902 [2024-11-12 07:39:46,942 INFO L226 Difference]: Without dead ends: 576 [2024-11-12 07:39:46,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:46,943 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 51 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 384 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-12 07:39:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-12 07:39:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 523. [2024-11-12 07:39:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 484 states have (on average 1.371900826446281) internal successors, (664), 485 states have internal predecessors, (664), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 716 transitions. [2024-11-12 07:39:46,965 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 716 transitions. Word has length 110 [2024-11-12 07:39:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:46,965 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 716 transitions. [2024-11-12 07:39:46,965 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 716 transitions. [2024-11-12 07:39:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:46,966 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:46,966 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:46,973 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-11-12 07:39:47,167 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-11-12 07:39:47,167 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 983365544, now seen corresponding path program 1 times [2024-11-12 07:39:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664824890] [2024-11-12 07:39:47,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:47,171 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-11-12 07:39:47,173 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-11-12 07:39:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:47,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:39:47,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:47,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:47,474 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 71 treesize of output 41 [2024-11-12 07:39:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:39:47,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:47,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664824890] [2024-11-12 07:39:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664824890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:47,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583660899] [2024-11-12 07:39:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:47,510 INFO L87 Difference]: Start difference. First operand 523 states and 716 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:48,179 INFO L93 Difference]: Finished difference Result 1056 states and 1473 transitions. [2024-11-12 07:39:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:39:48,180 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-12 07:39:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:48,182 INFO L225 Difference]: With dead ends: 1056 [2024-11-12 07:39:48,182 INFO L226 Difference]: Without dead ends: 705 [2024-11-12 07:39:48,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:39:48,183 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:48,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 541 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:39:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-12 07:39:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 561. [2024-11-12 07:39:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 522 states have (on average 1.3812260536398469) internal successors, (721), 523 states have internal predecessors, (721), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:39:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 773 transitions. [2024-11-12 07:39:48,212 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 773 transitions. Word has length 111 [2024-11-12 07:39:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 773 transitions. [2024-11-12 07:39:48,212 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:39:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 773 transitions. [2024-11-12 07:39:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 07:39:48,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:48,214 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:39:48,222 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-11-12 07:39:48,414 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-11-12 07:39:48,415 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -37702810, now seen corresponding path program 1 times [2024-11-12 07:39:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059115969] [2024-11-12 07:39:48,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:39:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:48,417 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-11-12 07:39:48,417 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-11-12 07:39:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:48,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 07:39:48,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:48,673 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-11-12 07:39:48,776 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 36 treesize of output 29 [2024-11-12 07:39:48,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:48,882 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-11-12 07:39:48,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:48,979 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-11-12 07:39:49,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:49,066 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-11-12 07:39:49,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:49,128 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-11-12 07:39:49,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:49,214 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 27 [2024-11-12 07:39:49,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:49,237 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 31 treesize of output 13 [2024-11-12 07:39:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-12 07:39:49,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:49,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059115969] [2024-11-12 07:39:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059115969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015560934] [2024-11-12 07:39:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:39:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:39:49,398 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:39:49,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-12 07:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:49,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 07:39:49,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:49,999 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 12 treesize of output 8 [2024-11-12 07:39:50,183 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 30 treesize of output 25 [2024-11-12 07:39:50,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,336 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 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-12 07:39:50,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,536 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 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-12 07:39:50,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-12 07:39:50,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,752 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 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-12 07:39:50,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,889 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 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-12 07:39:50,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 07:39:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-12 07:39:50,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:50,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015560934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:50,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:39:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2024-11-12 07:39:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691275585] [2024-11-12 07:39:50,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:39:50,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 07:39:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 07:39:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:39:50,990 INFO L87 Difference]: Start difference. First operand 561 states and 773 transitions. Second operand has 18 states, 16 states have (on average 6.8125) internal successors, (109), 16 states have internal predecessors, (109), 9 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24)