./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.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_valuebound20.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 014459ae7f9a4506b7655fe1f167856eb64829e3739070f7d1f854e4ecd5b5bc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:58:40,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:58:40,868 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:40,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:58:40,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:58:40,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:58:40,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:58:40,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:58:40,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:58:40,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:58:40,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:58:40,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:58:40,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:58:40,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:58:40,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:58:40,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:58:40,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:58:40,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:58:40,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:58:40,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:58:40,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:58:40,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:58:40,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:58:40,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:58:40,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:58:40,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:58:40,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:58:40,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:58:40,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:58:40,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:58:40,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:58:40,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:58:40,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:40,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:58:40,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:58:40,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:58:40,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:58:40,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:58:40,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:58:40,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:58:40,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:58:40,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:58:40,917 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 -> 014459ae7f9a4506b7655fe1f167856eb64829e3739070f7d1f854e4ecd5b5bc [2024-11-11 19:58:41,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:58:41,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:58:41,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:58:41,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:58:41,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:58:41,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2024-11-11 19:58:42,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:58:42,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:58:42,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound20.c [2024-11-11 19:58:42,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4dfc621c/90246940fd154ea4be91ea0134bdf6af/FLAGff3fb62b9 [2024-11-11 19:58:43,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4dfc621c/90246940fd154ea4be91ea0134bdf6af [2024-11-11 19:58:43,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:58:43,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:58:43,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:43,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:58:43,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:58:43,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:43" (1/1) ... [2024-11-11 19:58:43,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3601310e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:43, skipping insertion in model container [2024-11-11 19:58:43,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:43" (1/1) ... [2024-11-11 19:58:43,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:58:43,389 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_valuebound20.c[576,589] [2024-11-11 19:58:43,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:43,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:58:43,426 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_valuebound20.c[576,589] [2024-11-11 19:58:43,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:43,448 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:58:43,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:43 WrapperNode [2024-11-11 19:58:43,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:43,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:43,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:58:43,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:58:43,456 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:43" (1/1) ... [2024-11-11 19:58:43,463 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:43" (1/1) ... [2024-11-11 19:58:43,478 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-11 19:58:43,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:43,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:58:43,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:58:43,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:58:43,489 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:43" (1/1) ... [2024-11-11 19:58:43,490 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:43" (1/1) ... [2024-11-11 19:58:43,491 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:43" (1/1) ... [2024-11-11 19:58:43,502 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:43,502 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:43" (1/1) ... [2024-11-11 19:58:43,502 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:43" (1/1) ... [2024-11-11 19:58:43,505 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:43" (1/1) ... [2024-11-11 19:58:43,509 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:43" (1/1) ... [2024-11-11 19:58:43,510 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:43" (1/1) ... [2024-11-11 19:58:43,511 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:43" (1/1) ... [2024-11-11 19:58:43,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:58:43,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:58:43,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:58:43,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:58:43,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:43" (1/1) ... [2024-11-11 19:58:43,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:43,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:43,554 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:43,561 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:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:58:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 19:58:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 19:58:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:58:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:58:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:58:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 19:58:43,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 19:58:43,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:58:43,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:58:43,901 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 19:58:43,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:58:43,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:58:43,917 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:58:43,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:43 BoogieIcfgContainer [2024-11-11 19:58:43,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:58:43,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:58:43,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:58:43,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:58:43,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:58:43" (1/3) ... [2024-11-11 19:58:43,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d5e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:43, skipping insertion in model container [2024-11-11 19:58:43,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:43" (2/3) ... [2024-11-11 19:58:43,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d5e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:43, skipping insertion in model container [2024-11-11 19:58:43,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:43" (3/3) ... [2024-11-11 19:58:43,928 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound20.c [2024-11-11 19:58:43,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:58:43,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:58:44,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:58:44,013 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;@164fa916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:58:44,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:58:44,017 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:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:58:44,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:44,026 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:44,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:44,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1389076267, now seen corresponding path program 1 times [2024-11-11 19:58:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465485955] [2024-11-11 19:58:44,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,211 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:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465485955] [2024-11-11 19:58:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465485955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:58:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762035106] [2024-11-11 19:58:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:58:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:58:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:58:44,244 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:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:44,269 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2024-11-11 19:58:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:58:44,272 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:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:44,279 INFO L225 Difference]: With dead ends: 65 [2024-11-11 19:58:44,279 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:58:44,283 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:44,289 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:44,290 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:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:58:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:58:44,326 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:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-11 19:58:44,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2024-11-11 19:58:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:44,331 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-11 19:58:44,332 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:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-11 19:58:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:58:44,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:44,335 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:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:58:44,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:44,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 240368937, now seen corresponding path program 1 times [2024-11-11 19:58:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26586658] [2024-11-11 19:58:44,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912658655] [2024-11-11 19:58:44,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:44,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:44,406 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:44,408 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:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:44,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:44,601 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:44,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26586658] [2024-11-11 19:58:44,603 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912658655] [2024-11-11 19:58:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912658655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847630939] [2024-11-11 19:58:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:44,611 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:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:44,674 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-11 19:58:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:44,675 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:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:44,676 INFO L225 Difference]: With dead ends: 41 [2024-11-11 19:58:44,676 INFO L226 Difference]: Without dead ends: 39 [2024-11-11 19:58:44,677 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:44,678 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:44,679 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:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-11 19:58:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-11 19:58:44,689 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:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-11 19:58:44,690 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 24 [2024-11-11 19:58:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:44,691 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-11 19:58:44,691 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:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-11 19:58:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:58:44,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:44,693 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:44,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:58:44,897 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:44,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:44,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash -854318377, now seen corresponding path program 1 times [2024-11-11 19:58:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045383296] [2024-11-11 19:58:44,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994377845] [2024-11-11 19:58:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:44,940 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:44,943 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:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:44,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:45,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:45,049 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:45,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045383296] [2024-11-11 19:58:45,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994377845] [2024-11-11 19:58:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994377845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941280201] [2024-11-11 19:58:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:45,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:45,054 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:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:45,140 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-11 19:58:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:45,141 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:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:45,142 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:58:45,142 INFO L226 Difference]: Without dead ends: 50 [2024-11-11 19:58:45,143 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:45,144 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:45,144 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:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-11 19:58:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-11 19:58:45,159 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:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-11 19:58:45,161 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2024-11-11 19:58:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:45,162 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-11 19:58:45,162 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:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-11 19:58:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 19:58:45,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:45,165 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:45,177 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:45,365 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:45,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:45,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1997084946, now seen corresponding path program 1 times [2024-11-11 19:58:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004856651] [2024-11-11 19:58:45,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:45,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907201536] [2024-11-11 19:58:45,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:45,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:45,415 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:45,417 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:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:45,510 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:45,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:45,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004856651] [2024-11-11 19:58:45,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:45,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907201536] [2024-11-11 19:58:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907201536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138370800] [2024-11-11 19:58:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:45,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:45,517 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:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:45,598 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-11 19:58:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:45,599 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:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:45,601 INFO L225 Difference]: With dead ends: 75 [2024-11-11 19:58:45,601 INFO L226 Difference]: Without dead ends: 73 [2024-11-11 19:58:45,601 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:45,602 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:45,603 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:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-11 19:58:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-11 19:58:45,622 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:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2024-11-11 19:58:45,627 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 36 [2024-11-11 19:58:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:45,627 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2024-11-11 19:58:45,628 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:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-11 19:58:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 19:58:45,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:45,629 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:45,646 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:45,829 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:45,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2056573358, now seen corresponding path program 1 times [2024-11-11 19:58:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948031501] [2024-11-11 19:58:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,283 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:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948031501] [2024-11-11 19:58:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948031501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150193567] [2024-11-11 19:58:46,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:46,286 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:46,287 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:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:46,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:58:46,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:46,446 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:46,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:46,589 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:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150193567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:46,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2024-11-11 19:58:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392667735] [2024-11-11 19:58:46,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:58:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:58:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:46,593 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:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:46,709 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-11-11 19:58:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:58:46,710 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:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:46,713 INFO L225 Difference]: With dead ends: 74 [2024-11-11 19:58:46,713 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 19:58:46,713 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:46,714 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:46,714 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:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 19:58:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-11 19:58:46,727 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:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-11 19:58:46,729 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 46 [2024-11-11 19:58:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:46,730 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-11 19:58:46,730 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:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-11 19:58:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 19:58:46,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:46,732 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:46,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:58:46,932 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:46,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2085516536, now seen corresponding path program 1 times [2024-11-11 19:58:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312510310] [2024-11-11 19:58:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,131 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:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:47,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312510310] [2024-11-11 19:58:47,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312510310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255663701] [2024-11-11 19:58:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:47,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:47,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:47,134 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:47,135 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:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:47,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:47,273 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:47,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255663701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:47,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-11 19:58:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018624723] [2024-11-11 19:58:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:58:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:58:47,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:47,275 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:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:47,370 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-11 19:58:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:58:47,371 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:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:47,373 INFO L225 Difference]: With dead ends: 83 [2024-11-11 19:58:47,373 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 19:58:47,373 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:47,374 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:47,374 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:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 19:58:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-11 19:58:47,393 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:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2024-11-11 19:58:47,395 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 52 [2024-11-11 19:58:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:47,395 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2024-11-11 19:58:47,396 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:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-11 19:58:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 19:58:47,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:47,399 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:47,417 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:47,599 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:47,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:47,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1724367982, now seen corresponding path program 1 times [2024-11-11 19:58:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497875440] [2024-11-11 19:58:47,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274711855] [2024-11-11 19:58:47,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:47,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:47,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:47,625 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:47,630 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:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:47,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 19:58:47,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:48,006 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:48,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:48,228 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:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497875440] [2024-11-11 19:58:48,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274711855] [2024-11-11 19:58:48,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274711855] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:48,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:48,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-11 19:58:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864133352] [2024-11-11 19:58:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:58:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:48,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:58:48,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:58:48,233 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:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:48,354 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-11-11 19:58:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:48,355 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:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:48,357 INFO L225 Difference]: With dead ends: 82 [2024-11-11 19:58:48,359 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 19:58:48,360 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:48,361 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:48,361 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:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 19:58:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-11 19:58:48,387 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:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-11-11 19:58:48,389 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 59 [2024-11-11 19:58:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:48,391 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-11-11 19:58:48,391 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:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-11-11 19:58:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 19:58:48,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:48,392 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:48,410 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:48,593 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:48,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:48,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash -666558580, now seen corresponding path program 1 times [2024-11-11 19:58:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288458779] [2024-11-11 19:58:48,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 19:58:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 19:58:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 19:58:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,780 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:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288458779] [2024-11-11 19:58:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288458779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095643287] [2024-11-11 19:58:48,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:48,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:48,783 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:48,784 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:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:48,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:58:48,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:48,885 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:48,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:48,983 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:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095643287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-11-11 19:58:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624395282] [2024-11-11 19:58:48,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:58:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:58:48,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:48,985 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:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:49,095 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2024-11-11 19:58:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:58:49,096 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:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:49,099 INFO L225 Difference]: With dead ends: 89 [2024-11-11 19:58:49,099 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 19:58:49,100 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:49,101 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:49,101 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:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 19:58:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2024-11-11 19:58:49,123 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:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-11-11 19:58:49,123 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 75 [2024-11-11 19:58:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:49,124 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-11-11 19:58:49,124 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:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-11 19:58:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 19:58:49,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:49,125 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:49,142 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:49,329 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:49,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -648409701, now seen corresponding path program 2 times [2024-11-11 19:58:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761840363] [2024-11-11 19:58:49,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 19:58:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 19:58:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 19:58:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:49,468 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:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761840363] [2024-11-11 19:58:49,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761840363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:49,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989574050] [2024-11-11 19:58:49,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:58:49,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:49,471 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:49,472 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:49,525 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:58:49,525 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:58:49,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 19:58:49,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:49,579 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:49,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989574050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-11 19:58:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175098330] [2024-11-11 19:58:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:49,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:49,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:49,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:58:49,584 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:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:49,685 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2024-11-11 19:58:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:49,686 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:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:49,687 INFO L225 Difference]: With dead ends: 113 [2024-11-11 19:58:49,687 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 19:58:49,688 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:49,688 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:49,688 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.1s Time] [2024-11-11 19:58:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 19:58:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-11 19:58:49,705 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:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2024-11-11 19:58:49,706 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 76 [2024-11-11 19:58:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:49,707 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2024-11-11 19:58:49,707 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:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2024-11-11 19:58:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 19:58:49,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:49,708 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:49,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 19:58:49,909 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:49,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:49,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2052675103, now seen corresponding path program 1 times [2024-11-11 19:58:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238354033] [2024-11-11 19:58:49,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:58:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 19:58:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 19:58:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:58:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:58:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 19:58:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 19:58:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:58:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 19:58:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 19:58:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 19:58:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 19:58:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 19:58:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 19:58:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 19:58:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 19:58:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,115 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:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238354033] [2024-11-11 19:58:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238354033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855246878] [2024-11-11 19:58:50,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:50,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:50,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:50,118 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:50,119 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:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:50,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:58:50,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:50,311 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:50,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:50,546 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:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855246878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:50,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-11-11 19:58:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592569788] [2024-11-11 19:58:50,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:58:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:58:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:58:50,548 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:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:51,262 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2024-11-11 19:58:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:58:51,263 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:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:51,263 INFO L225 Difference]: With dead ends: 141 [2024-11-11 19:58:51,263 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:58:51,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:58:51,265 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:51,266 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.3s Time] [2024-11-11 19:58:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:58:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:58:51,266 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:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:58:51,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-11-11 19:58:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:58:51,267 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:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:58:51,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:58:51,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:58:51,286 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:51,470 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:51,473 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:51,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:58:53,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:58:53,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:58:53 BoogieIcfgContainer [2024-11-11 19:58:53,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:58:53,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:58:53,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:58:53,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:58:53,253 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:43" (3/4) ... [2024-11-11 19:58:53,255 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:58:53,258 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-11 19:58:53,259 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 19:58:53,262 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-11 19:58:53,263 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:58:53,263 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:58:53,263 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:58:53,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:58:53,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:58:53,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:58:53,357 INFO L158 Benchmark]: Toolchain (without parser) took 10142.95ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 139.9MB in the beginning and 62.9MB in the end (delta: 77.0MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,357 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:58:53,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.84ms. Allocated memory is still 172.0MB. Free memory was 138.9MB in the beginning and 126.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 172.0MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,358 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 123.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:58:53,358 INFO L158 Benchmark]: RCFGBuilder took 404.36ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 138.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,358 INFO L158 Benchmark]: TraceAbstraction took 9331.08ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 137.6MB in the beginning and 67.1MB in the end (delta: 70.4MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,359 INFO L158 Benchmark]: Witness Printer took 104.20ms. Allocated memory is still 207.6MB. Free memory was 67.1MB in the beginning and 62.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:58:53,360 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.84ms. Allocated memory is still 172.0MB. Free memory was 138.9MB in the beginning and 126.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 172.0MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 172.0MB. Free memory was 124.7MB in the beginning and 123.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.36ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 138.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9331.08ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 137.6MB in the beginning and 67.1MB in the end (delta: 70.4MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. * Witness Printer took 104.20ms. Allocated memory is still 207.6MB. Free memory was 67.1MB in the beginning and 62.9MB 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 1756 SdHoareTripleChecker+Invalid, 0.7s 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, 1.1s 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s 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)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) && (x <= 20)) || (((((((((__int128) a * y) + r) == ((__int128) b + x)) && (0 <= r)) && (r == x)) && (q == 0)) && (x <= 20)) && (b < ((long long) y + 1)))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((0 <= x) && (x == (r + ((__int128) q * y)))) && (0 <= y)) && (0 <= ((__int128) r + y))) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) && (x <= 20)) || ((((((((__int128) r + 1) <= y) && (0 <= x)) && (x == (r + ((__int128) q * y)))) && (b <= y)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) && (x <= 20))) || ((((((b == 0) && (0 <= r)) && (r == x)) && (q == 0)) && (a == 0)) && (x <= 20))) - 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:53,378 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