./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.c --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/nla-digbench-scaling/cohendiv-ll_valuebound100.c -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 4da533f9027cb26869f2cd2349cd7115ebf62144e1d11b018683e8601f934a1d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:58:36,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:58:36,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:58:36,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:58:36,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:58:36,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:58:36,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:58:36,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:58:36,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:58:36,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:58:36,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:58:36,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:58:36,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:58:36,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:58:36,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:58:36,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:58:36,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:58:36,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:58:36,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:58:36,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:58:36,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:58:36,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:58:36,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:58:36,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:58:36,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:58:36,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:58:36,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:58:36,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:58:36,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:58:36,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:58:36,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:58:36,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:58:36,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:36,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:58:36,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:58:36,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:58:36,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:58:36,995 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 -> 4da533f9027cb26869f2cd2349cd7115ebf62144e1d11b018683e8601f934a1d [2024-11-11 19:58:37,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:58:37,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:58:37,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:58:37,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:58:37,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:58:37,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.c [2024-11-11 19:58:38,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:58:38,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:58:38,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound100.c [2024-11-11 19:58:38,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22fba58d/bfdfbbecbb7349faa83be89cbb3e3688/FLAG650274463 [2024-11-11 19:58:39,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22fba58d/bfdfbbecbb7349faa83be89cbb3e3688 [2024-11-11 19:58:39,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:58:39,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:58:39,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:39,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:58:39,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:58:39,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e0e8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39, skipping insertion in model container [2024-11-11 19:58:39,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:58:39,503 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/nla-digbench-scaling/cohendiv-ll_valuebound100.c[576,589] [2024-11-11 19:58:39,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:39,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:58:39,548 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/nla-digbench-scaling/cohendiv-ll_valuebound100.c[576,589] [2024-11-11 19:58:39,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:39,571 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:58:39,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39 WrapperNode [2024-11-11 19:58:39,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:39,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:39,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:58:39,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:58:39,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,613 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-11 19:58:39,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:39,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:58:39,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:58:39,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:58:39,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 19:58:39,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:58:39,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:58:39,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:58:39,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:58:39,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (1/1) ... [2024-11-11 19:58:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:39,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:39,681 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-11 19:58:39,692 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-11 19:58:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:58:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 19:58:39,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 19:58:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:58:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:58:39,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:58:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 19:58:39,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 19:58:39,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:58:39,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:58:40,026 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 19:58:40,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:58:40,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:58:40,040 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:58:40,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:40 BoogieIcfgContainer [2024-11-11 19:58:40,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:58:40,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:58:40,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:58:40,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:58:40,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:58:39" (1/3) ... [2024-11-11 19:58:40,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119d73bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:40, skipping insertion in model container [2024-11-11 19:58:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:39" (2/3) ... [2024-11-11 19:58:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119d73bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:40, skipping insertion in model container [2024-11-11 19:58:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:40" (3/3) ... [2024-11-11 19:58:40,048 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound100.c [2024-11-11 19:58:40,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:58:40,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:58:40,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:58:40,117 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;@4ef43226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:58:40,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:58:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 19:58:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:58:40,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:40,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:40,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1389076267, now seen corresponding path program 1 times [2024-11-11 19:58:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:40,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517964680] [2024-11-11 19:58:40,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:58:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517964680] [2024-11-11 19:58:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517964680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:58:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135789956] [2024-11-11 19:58:40,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:58:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:58:40,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:58:40,317 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 19:58:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:40,333 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2024-11-11 19:58:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:58:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-11 19:58:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:40,340 INFO L225 Difference]: With dead ends: 65 [2024-11-11 19:58:40,340 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:58:40,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11 19:58:40,345 INFO L435 NwaCegarLoop]: 43 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, 43 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-11 19:58:40,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:58:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:58:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 19:58:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-11 19:58:40,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2024-11-11 19:58:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:40,374 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-11 19:58:40,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 19:58:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-11 19:58:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:58:40,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:40,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:40,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:58:40,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 240368937, now seen corresponding path program 1 times [2024-11-11 19:58:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549461709] [2024-11-11 19:58:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154369875] [2024-11-11 19:58:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:40,403 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-11 19:58:40,404 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-11 19:58:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:40,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:58:40,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:40,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549461709] [2024-11-11 19:58:40,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:40,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154369875] [2024-11-11 19:58:40,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154369875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:40,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556169592] [2024-11-11 19:58:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:40,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:40,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:40,575 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:58:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:40,613 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-11 19:58:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-11 19:58:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:40,614 INFO L225 Difference]: With dead ends: 41 [2024-11-11 19:58:40,614 INFO L226 Difference]: Without dead ends: 39 [2024-11-11 19:58:40,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:40,616 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:40,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-11 19:58:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-11 19:58:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 19:58:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-11 19:58:40,627 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 24 [2024-11-11 19:58:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:40,627 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-11 19:58:40,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:58:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-11 19:58:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:58:40,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:40,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:40,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:40,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -854318377, now seen corresponding path program 1 times [2024-11-11 19:58:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812476092] [2024-11-11 19:58:40,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268862048] [2024-11-11 19:58:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:40,859 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-11 19:58:40,860 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-11 19:58:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:40,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:40,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:58:40,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812476092] [2024-11-11 19:58:40,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268862048] [2024-11-11 19:58:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268862048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:40,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:40,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:40,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832468395] [2024-11-11 19:58:40,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:40,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:40,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:40,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:40,981 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:58:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:41,057 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-11 19:58:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-11 19:58:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:41,059 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:58:41,061 INFO L226 Difference]: Without dead ends: 50 [2024-11-11 19:58:41,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:41,062 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:41,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-11 19:58:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-11 19:58:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-11 19:58:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-11 19:58:41,078 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2024-11-11 19:58:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-11 19:58:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:58:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-11 19:58:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 19:58:41,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:41,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:41,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:58:41,279 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,SelfDestructingSolverStorable2 [2024-11-11 19:58:41,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1997084946, now seen corresponding path program 1 times [2024-11-11 19:58:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067525089] [2024-11-11 19:58:41,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:41,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92799524] [2024-11-11 19:58:41,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:41,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:41,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:58:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:41,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 19:58:41,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067525089] [2024-11-11 19:58:41,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:41,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92799524] [2024-11-11 19:58:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92799524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:41,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388840127] [2024-11-11 19:58:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:41,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:41,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:41,403 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 19:58:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:41,479 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-11 19:58:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-11-11 19:58:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:41,481 INFO L225 Difference]: With dead ends: 75 [2024-11-11 19:58:41,481 INFO L226 Difference]: Without dead ends: 73 [2024-11-11 19:58:41,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:41,482 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:41,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-11 19:58:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-11 19:58:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-11 19:58:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2024-11-11 19:58:41,495 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 36 [2024-11-11 19:58:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:41,496 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2024-11-11 19:58:41,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 19:58:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-11 19:58:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 19:58:41,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:41,497 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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-11 19:58:41,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:41,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:41,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2056573358, now seen corresponding path program 1 times [2024-11-11 19:58:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469467828] [2024-11-11 19:58:41,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 19:58:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469467828] [2024-11-11 19:58:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469467828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887280754] [2024-11-11 19:58:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:41,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:41,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:41,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:42,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:58:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:58:42,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 19:58:42,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 19:58:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887280754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:42,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2024-11-11 19:58:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664489739] [2024-11-11 19:58:42,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:58:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:58:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:42,208 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-11 19:58:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:42,293 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-11-11 19:58:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:58:42,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 46 [2024-11-11 19:58:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:42,295 INFO L225 Difference]: With dead ends: 74 [2024-11-11 19:58:42,296 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 19:58:42,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:58:42,297 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:42,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 171 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 19:58:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-11 19:58:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-11 19:58:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-11 19:58:42,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 46 [2024-11-11 19:58:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-11 19:58:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-11 19:58:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-11 19:58:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 19:58:42,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:42,312 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 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-11 19:58:42,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:42,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2085516536, now seen corresponding path program 1 times [2024-11-11 19:58:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655696042] [2024-11-11 19:58:42,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 19:58:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655696042] [2024-11-11 19:58:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655696042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26395834] [2024-11-11 19:58:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:42,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:42,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:42,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:58:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:42,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-11 19:58:42,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26395834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-11 19:58:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823486933] [2024-11-11 19:58:42,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:42,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:58:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:58:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:42,832 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 19:58:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:42,916 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-11 19:58:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:58:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-11-11 19:58:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:42,921 INFO L225 Difference]: With dead ends: 83 [2024-11-11 19:58:42,921 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 19:58:42,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:42,922 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:42,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 19:58:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-11 19:58:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 19:58:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2024-11-11 19:58:42,941 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 52 [2024-11-11 19:58:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:42,942 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2024-11-11 19:58:42,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 19:58:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-11 19:58:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 19:58:42,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:42,943 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 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-11 19:58:42,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:58:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:43,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1724367982, now seen corresponding path program 1 times [2024-11-11 19:58:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013319590] [2024-11-11 19:58:43,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953477230] [2024-11-11 19:58:43,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:43,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:43,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:43,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:58:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:43,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 19:58:43,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-11 19:58:43,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-11 19:58:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013319590] [2024-11-11 19:58:43,629 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953477230] [2024-11-11 19:58:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953477230] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-11 19:58:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123461507] [2024-11-11 19:58:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:43,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:58:43,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:43,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:58:43,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:58:43,631 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-11 19:58:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:43,731 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-11-11 19:58:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2024-11-11 19:58:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:43,735 INFO L225 Difference]: With dead ends: 82 [2024-11-11 19:58:43,735 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 19:58:43,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:58:43,736 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:43,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 134 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 19:58:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-11 19:58:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 19:58:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-11-11 19:58:43,775 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 59 [2024-11-11 19:58:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-11-11 19:58:43,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-11 19:58:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-11-11 19:58:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 19:58:43,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:43,778 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:43,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:43,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash -666558580, now seen corresponding path program 1 times [2024-11-11 19:58:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797788231] [2024-11-11 19:58:43,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 19:58:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 19:58:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 19:58:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-11 19:58:44,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797788231] [2024-11-11 19:58:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797788231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557627804] [2024-11-11 19:58:44,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:44,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:44,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:58:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:58:44,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-11 19:58:44,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-11 19:58:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557627804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:44,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-11-11 19:58:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592798880] [2024-11-11 19:58:44,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:58:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:58:44,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:44,385 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 19:58:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:44,466 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2024-11-11 19:58:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:58:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 75 [2024-11-11 19:58:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:44,468 INFO L225 Difference]: With dead ends: 89 [2024-11-11 19:58:44,468 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 19:58:44,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:44,469 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:44,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 118 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 19:58:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2024-11-11 19:58:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-11 19:58:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-11-11 19:58:44,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 75 [2024-11-11 19:58:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:44,480 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-11-11 19:58:44,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 19:58:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-11 19:58:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 19:58:44,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:44,481 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:44,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 19:58:44,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:44,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:44,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -648409701, now seen corresponding path program 2 times [2024-11-11 19:58:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753769617] [2024-11-11 19:58:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 19:58:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 19:58:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 19:58:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-11 19:58:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753769617] [2024-11-11 19:58:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753769617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553412183] [2024-11-11 19:58:44,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:58:44,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:44,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:44,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:44,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:58:44,816 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:58:44,816 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:58:44,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 19:58:44,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 19:58:44,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553412183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:44,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-11 19:58:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478129515] [2024-11-11 19:58:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:44,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:58:44,856 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 19:58:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:44,925 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2024-11-11 19:58:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:44,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2024-11-11 19:58:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:44,927 INFO L225 Difference]: With dead ends: 113 [2024-11-11 19:58:44,927 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 19:58:44,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:58:44,927 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:44,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 19:58:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-11 19:58:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-11 19:58:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2024-11-11 19:58:44,940 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 76 [2024-11-11 19:58:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:44,941 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2024-11-11 19:58:44,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 19:58:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2024-11-11 19:58:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 19:58:44,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:44,942 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:44,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:45,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-11 19:58:45,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2052675103, now seen corresponding path program 1 times [2024-11-11 19:58:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291425856] [2024-11-11 19:58:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 19:58:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 19:58:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 19:58:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 19:58:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 19:58:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 19:58:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 19:58:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-11 19:58:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291425856] [2024-11-11 19:58:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291425856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660196758] [2024-11-11 19:58:45,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:45,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:45,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 19:58:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:58:45,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-11 19:58:45,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-11 19:58:45,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660196758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:45,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:45,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-11-11 19:58:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797727656] [2024-11-11 19:58:45,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:58:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:58:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:58:45,718 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 12 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-11 19:58:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:46,218 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2024-11-11 19:58:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:58:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 12 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 99 [2024-11-11 19:58:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:46,219 INFO L225 Difference]: With dead ends: 141 [2024-11-11 19:58:46,219 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:58:46,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:58:46,221 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 641 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:58:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:58:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:58:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:58:46,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-11-11 19:58:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:46,222 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:58:46,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 12 states have call successors, (39), 3 states have call predecessors, (39), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-11 19:58:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:58:46,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:58:46,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:58:46,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 19:58:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 19:58:46,428 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:46,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:58:47,496 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:58:47,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:58:47 BoogieIcfgContainer [2024-11-11 19:58:47,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:58:47,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:58:47,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:58:47,516 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:58:47,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:40" (3/4) ... [2024-11-11 19:58:47,519 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:58:47,521 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-11 19:58:47,522 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 19:58:47,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-11 19:58:47,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:58:47,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:58:47,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:58:47,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:58:47,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:58:47,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:58:47,597 INFO L158 Benchmark]: Toolchain (without parser) took 8257.81ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 114.6MB in the beginning and 172.3MB in the end (delta: -57.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,597 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:58:47,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.29ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 101.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.70ms. Allocated memory is still 184.5MB. Free memory was 101.8MB in the beginning and 100.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,597 INFO L158 Benchmark]: Boogie Preprocessor took 25.66ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,598 INFO L158 Benchmark]: RCFGBuilder took 399.46ms. Allocated memory is still 184.5MB. Free memory was 98.5MB in the beginning and 148.1MB in the end (delta: -49.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,598 INFO L158 Benchmark]: TraceAbstraction took 7473.15ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 147.2MB in the beginning and 176.5MB in the end (delta: -29.3MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,598 INFO L158 Benchmark]: Witness Printer took 80.24ms. Allocated memory is still 257.9MB. Free memory was 176.5MB in the beginning and 172.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:58:47,599 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.11ms. Allocated memory is still 184.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.29ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 101.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.70ms. Allocated memory is still 184.5MB. Free memory was 101.8MB in the beginning and 100.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.66ms. Allocated memory is still 184.5MB. Free memory was 100.1MB in the beginning and 98.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.46ms. Allocated memory is still 184.5MB. Free memory was 98.5MB in the beginning and 148.1MB in the end (delta: -49.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7473.15ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 147.2MB in the beginning and 176.5MB in the end (delta: -29.3MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 80.24ms. Allocated memory is still 257.9MB. Free memory was 176.5MB in the beginning and 172.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 1756 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1390 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 797 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 366 mSDtfsCounter, 797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 838 SyntacticMatches, 10 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1016 NumberOfCodeBlocks, 1016 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1128 ConstructedInterpolants, 0 QuantifiedInterpolants, 2407 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1157 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 2406/2493 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((0 <= x) && (x == (r + ((__int128) q * y)))) && (0 <= y)) && (b <= ((__int128) r + y))) && (0 <= r)) && (x <= 100)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) || (((((((((__int128) a * y) + r) == ((__int128) b + x)) && (b <= y)) && (0 <= r)) && (x <= 100)) && (r == x)) && (q == 0))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((b == 0) && (0 <= r)) && (x <= 100)) && (r == x)) && (q == 0)) && (a == 0)) || ((((((((__int128) r + 1) <= y) && (0 <= x)) && (x == (r + ((__int128) q * y)))) && (b <= y)) && (x <= 100)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y))))) || ((((((0 <= x) && (x == (r + ((__int128) q * y)))) && (0 <= y)) && (x <= 100)) && (0 <= ((__int128) r + y))) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y))))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-11 19:58:47,615 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 Writing output log to file Ultimate.log Result: TRUE