./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.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/mannadiv_unwindbound20.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 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:20:23,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:20:24,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:20:24,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:20:24,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:20:24,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:20:24,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:20:24,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:20:24,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:20:24,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:20:24,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:20:24,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:20:24,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:20:24,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:20:24,080 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:20:24,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:20:24,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:20:24,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:20:24,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:20:24,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:20:24,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:20:24,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:20:24,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:20:24,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:20:24,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:20:24,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:20:24,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:20:24,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:20:24,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:20:24,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:20:24,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:20:24,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:20:24,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:20:24,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:20:24,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:20:24,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:20:24,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:20:24,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:20:24,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:20:24,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:20:24,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:20:24,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:20:24,089 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 -> 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa [2024-11-11 20:20:24,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:20:24,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:20:24,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:20:24,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:20:24,341 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:20:24,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2024-11-11 20:20:25,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:20:25,957 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:20:25,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2024-11-11 20:20:25,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f480c1712/bc1ffdee0e89499ab47b29855dec2f96/FLAG6428eff39 [2024-11-11 20:20:25,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f480c1712/bc1ffdee0e89499ab47b29855dec2f96 [2024-11-11 20:20:25,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:20:25,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:20:25,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:20:25,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:20:25,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:20:25,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:20:25" (1/1) ... [2024-11-11 20:20:25,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf7f011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:25, skipping insertion in model container [2024-11-11 20:20:25,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:20:25" (1/1) ... [2024-11-11 20:20:26,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:20:26,236 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/mannadiv_unwindbound20.c[573,586] [2024-11-11 20:20:26,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:20:26,256 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:20:26,267 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/mannadiv_unwindbound20.c[573,586] [2024-11-11 20:20:26,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:20:26,286 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:20:26,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26 WrapperNode [2024-11-11 20:20:26,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:20:26,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:20:26,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:20:26,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:20:26,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,320 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-11 20:20:26,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:20:26,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:20:26,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:20:26,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:20:26,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,353 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 20:20:26,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:20:26,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:20:26,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:20:26,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:20:26,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (1/1) ... [2024-11-11 20:20:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:20:26,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:26,397 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 20:20:26,399 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 20:20:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:20:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 20:20:26,436 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 20:20:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:20:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:20:26,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:20:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 20:20:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 20:20:26,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:20:26,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:20:26,631 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-11 20:20:26,632 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:20:26,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:20:26,645 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:20:26,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:20:26 BoogieIcfgContainer [2024-11-11 20:20:26,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:20:26,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:20:26,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:20:26,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:20:26,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:20:25" (1/3) ... [2024-11-11 20:20:26,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307f44e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:20:26, skipping insertion in model container [2024-11-11 20:20:26,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:20:26" (2/3) ... [2024-11-11 20:20:26,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307f44e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:20:26, skipping insertion in model container [2024-11-11 20:20:26,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:20:26" (3/3) ... [2024-11-11 20:20:26,654 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2024-11-11 20:20:26,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:20:26,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:20:26,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:20:26,724 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;@1bf4f3f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:20:26,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:20:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 20:20:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 20:20:26,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:26,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:26,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2024-11-11 20:20:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742332834] [2024-11-11 20:20:26,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742332834] [2024-11-11 20:20:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742332834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:20:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:20:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:20:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921806646] [2024-11-11 20:20:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:20:26,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:20:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:26,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:20:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:20:26,960 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:20:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:26,980 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-11-11 20:20:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:20:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-11 20:20:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:26,988 INFO L225 Difference]: With dead ends: 47 [2024-11-11 20:20:26,988 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 20:20:26,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 20:20:26,997 INFO L435 NwaCegarLoop]: 29 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, 29 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 20:20:26,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:20:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 20:20:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 20:20:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:20:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-11 20:20:27,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2024-11-11 20:20:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:27,041 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-11 20:20:27,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:20:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-11 20:20:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:20:27,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:27,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:27,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:20:27,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2024-11-11 20:20:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333262700] [2024-11-11 20:20:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333262700] [2024-11-11 20:20:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333262700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:20:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:20:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:20:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215714667] [2024-11-11 20:20:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:20:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:20:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:27,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:20:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:20:27,227 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:20:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:27,259 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-11 20:20:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:20:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-11 20:20:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:27,260 INFO L225 Difference]: With dead ends: 30 [2024-11-11 20:20:27,261 INFO L226 Difference]: Without dead ends: 23 [2024-11-11 20:20:27,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:20:27,262 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:27,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:20:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-11 20:20:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-11 20:20:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:20:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-11 20:20:27,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2024-11-11 20:20:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:27,275 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-11 20:20:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:20:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-11 20:20:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:20:27,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:27,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:27,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:20:27,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:27,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2024-11-11 20:20:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:27,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103630468] [2024-11-11 20:20:27,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:20:27,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28092872] [2024-11-11 20:20:27,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:27,316 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 20:20:27,317 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 20:20:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:27,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 20:20:27,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:27,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:20:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103630468] [2024-11-11 20:20:27,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:20:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28092872] [2024-11-11 20:20:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28092872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:20:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:20:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:20:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437396126] [2024-11-11 20:20:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:20:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:20:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:20:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:20:27,501 INFO L87 Difference]: Start difference. First operand 23 states and 27 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:20:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:27,564 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-11 20:20:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:20:27,565 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-11 20:20:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:27,567 INFO L225 Difference]: With dead ends: 32 [2024-11-11 20:20:27,567 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 20:20:27,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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 20:20:27,569 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:27,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:20:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 20:20:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-11 20:20:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 20:20:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-11 20:20:27,578 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2024-11-11 20:20:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:27,579 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-11 20:20:27,579 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:20:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-11 20:20:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:20:27,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:27,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:27,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:20:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:27,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:27,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2024-11-11 20:20:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:27,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990134401] [2024-11-11 20:20:27,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:27,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:20:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:28,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990134401] [2024-11-11 20:20:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990134401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:20:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595411500] [2024-11-11 20:20:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:28,111 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 20:20:28,114 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 20:20:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:20:28,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:28,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:20:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595411500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:20:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:20:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-11 20:20:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393868104] [2024-11-11 20:20:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:20:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:20:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:20:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:20:28,302 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:20:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:28,357 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-11 20:20:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:20:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-11 20:20:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:28,358 INFO L225 Difference]: With dead ends: 37 [2024-11-11 20:20:28,358 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 20:20:28,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:20:28,360 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:28,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:20:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 20:20:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-11 20:20:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 20:20:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-11 20:20:28,365 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2024-11-11 20:20:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-11 20:20:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:20:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-11 20:20:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:20:28,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:28,368 INFO L218 NwaCegarLoop]: trace histogram [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 20:20:28,384 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 20:20:28,568 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,SelfDestructingSolverStorable3 [2024-11-11 20:20:28,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:28,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2024-11-11 20:20:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921036030] [2024-11-11 20:20:28,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:20:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921036030] [2024-11-11 20:20:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921036030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:20:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616004530] [2024-11-11 20:20:28,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:28,667 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 20:20:28,668 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 20:20:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:28,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:20:28,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:28,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:20:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616004530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:20:28,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:20:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-11 20:20:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912505781] [2024-11-11 20:20:28,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:20:28,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:20:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:28,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:20:28,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:20:28,841 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-11 20:20:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:28,904 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-11-11 20:20:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:20:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 28 [2024-11-11 20:20:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:28,906 INFO L225 Difference]: With dead ends: 63 [2024-11-11 20:20:28,906 INFO L226 Difference]: Without dead ends: 56 [2024-11-11 20:20:28,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:20:28,907 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:20:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-11 20:20:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-11 20:20:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 40 states have internal predecessors, (48), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:20:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2024-11-11 20:20:28,915 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2024-11-11 20:20:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2024-11-11 20:20:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-11 20:20:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2024-11-11 20:20:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:20:28,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:28,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:28,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:20:29,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:29,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -125182207, now seen corresponding path program 1 times [2024-11-11 20:20:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048904892] [2024-11-11 20:20:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:20:29,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638712235] [2024-11-11 20:20:29,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:29,138 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 20:20:29,143 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 20:20:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 20:20:29,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:29,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:20:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:29,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:29,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048904892] [2024-11-11 20:20:29,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:20:29,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638712235] [2024-11-11 20:20:29,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638712235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:20:29,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:20:29,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-11 20:20:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785583669] [2024-11-11 20:20:29,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:20:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:20:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:20:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:20:29,397 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:20:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:29,503 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2024-11-11 20:20:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:20:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-11 20:20:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:29,505 INFO L225 Difference]: With dead ends: 107 [2024-11-11 20:20:29,505 INFO L226 Difference]: Without dead ends: 77 [2024-11-11 20:20:29,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:20:29,506 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:29,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:20:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-11 20:20:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2024-11-11 20:20:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:20:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-11 20:20:29,529 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 28 [2024-11-11 20:20:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-11 20:20:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:20:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-11 20:20:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:20:29,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:29,533 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:29,547 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 20:20:29,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:29,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -407057303, now seen corresponding path program 1 times [2024-11-11 20:20:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876661372] [2024-11-11 20:20:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:20:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:20:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:20:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876661372] [2024-11-11 20:20:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876661372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:20:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175643898] [2024-11-11 20:20:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:29,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:29,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:29,899 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 20:20:29,900 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 20:20:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:29,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 20:20:29,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:20:30,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:20:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:20:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175643898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:20:30,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:20:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2024-11-11 20:20:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257714460] [2024-11-11 20:20:30,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:20:30,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:20:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:20:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:20:30,178 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:20:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:30,346 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-11-11 20:20:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:20:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 34 [2024-11-11 20:20:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:30,348 INFO L225 Difference]: With dead ends: 66 [2024-11-11 20:20:30,349 INFO L226 Difference]: Without dead ends: 60 [2024-11-11 20:20:30,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:20:30,352 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:30,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:20:30,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-11 20:20:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-11-11 20:20:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 20:20:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-11 20:20:30,373 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 34 [2024-11-11 20:20:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-11 20:20:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:20:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-11 20:20:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 20:20:30,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:30,378 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:30,396 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 20:20:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:30,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2024-11-11 20:20:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823964488] [2024-11-11 20:20:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:20:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:20:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:20:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:20:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:20:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823964488] [2024-11-11 20:20:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823964488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:20:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143607157] [2024-11-11 20:20:30,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 20:20:30,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:30,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:30,745 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 20:20:30,747 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 20:20:30,805 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 20:20:30,805 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:20:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:20:30,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:30,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:20:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:20:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143607157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:20:31,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:20:31,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-11 20:20:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708831562] [2024-11-11 20:20:31,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:20:31,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:20:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:20:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:20:31,021 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-11 20:20:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:31,199 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2024-11-11 20:20:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:20:31,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 55 [2024-11-11 20:20:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:31,200 INFO L225 Difference]: With dead ends: 116 [2024-11-11 20:20:31,201 INFO L226 Difference]: Without dead ends: 111 [2024-11-11 20:20:31,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:20:31,202 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:31,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 144 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:20:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-11 20:20:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-11 20:20:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:20:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-11 20:20:31,223 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 55 [2024-11-11 20:20:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:31,223 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-11 20:20:31,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-11 20:20:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-11 20:20:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:20:31,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:31,225 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:31,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:20:31,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:31,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2024-11-11 20:20:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599719982] [2024-11-11 20:20:31,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:20:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:20:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:20:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:20:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:20:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:20:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 20:20:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:20:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:20:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:20:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:20:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:20:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:20:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-11 20:20:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:20:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599719982] [2024-11-11 20:20:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599719982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:20:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544551946] [2024-11-11 20:20:31,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 20:20:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:31,814 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 20:20:31,815 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 20:20:31,904 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-11 20:20:31,904 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 20:20:31,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 20:20:31,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:20:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 20:20:32,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:20:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-11 20:20:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544551946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:20:32,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:20:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 24 [2024-11-11 20:20:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582436121] [2024-11-11 20:20:32,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:20:32,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 20:20:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:20:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 20:20:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:20:32,384 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) [2024-11-11 20:20:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:20:32,787 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2024-11-11 20:20:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-11 20:20:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) Word has length 109 [2024-11-11 20:20:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:20:32,791 INFO L225 Difference]: With dead ends: 206 [2024-11-11 20:20:32,795 INFO L226 Difference]: Without dead ends: 201 [2024-11-11 20:20:32,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 20:20:32,797 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:20:32,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:20:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-11 20:20:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-11 20:20:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 155 states have (on average 1.135483870967742) internal successors, (176), 155 states have internal predecessors, (176), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 20:20:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2024-11-11 20:20:32,832 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 109 [2024-11-11 20:20:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:20:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2024-11-11 20:20:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 20 states have call predecessors, (35), 20 states have call successors, (35) [2024-11-11 20:20:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2024-11-11 20:20:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-11 20:20:32,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:20:32,838 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:32,855 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 20:20:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:33,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:20:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:20:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2024-11-11 20:20:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:20:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059015771] [2024-11-11 20:20:33,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:20:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:20:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:20:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500198037] [2024-11-11 20:20:33,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 20:20:33,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:20:33,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:20:33,146 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 20:20:33,148 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 20:20:33,268 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 20:20:33,268 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-11 20:20:33,268 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 20:20:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:20:33,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 20:20:33,399 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 20:20:33,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:20:33,419 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 20:20:33,602 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,SelfDestructingSolverStorable9 [2024-11-11 20:20:33,605 INFO L421 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-11-11 20:20:33,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:20:33,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:20:33 BoogieIcfgContainer [2024-11-11 20:20:33,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:20:33,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:20:33,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:20:33,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:20:33,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:20:26" (3/4) ... [2024-11-11 20:20:33,693 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 20:20:33,803 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:20:33,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:20:33,805 INFO L158 Benchmark]: Toolchain (without parser) took 7821.56ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 90.1MB in the beginning and 169.0MB in the end (delta: -78.9MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,805 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:20:33,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.96ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 125.3MB in the end (delta: -35.3MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.16ms. Allocated memory is still 157.3MB. Free memory was 124.9MB in the beginning and 123.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,807 INFO L158 Benchmark]: Boogie Preprocessor took 46.19ms. Allocated memory is still 157.3MB. Free memory was 123.7MB in the beginning and 121.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,807 INFO L158 Benchmark]: RCFGBuilder took 277.88ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 110.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,808 INFO L158 Benchmark]: TraceAbstraction took 7043.92ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 110.3MB in the beginning and 64.2MB in the end (delta: 46.1MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,808 INFO L158 Benchmark]: Witness Printer took 112.23ms. Allocated memory is still 205.5MB. Free memory was 64.2MB in the beginning and 169.0MB in the end (delta: -104.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 20:20:33,809 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 104.9MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.96ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 125.3MB in the end (delta: -35.3MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.16ms. Allocated memory is still 157.3MB. Free memory was 124.9MB in the beginning and 123.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.19ms. Allocated memory is still 157.3MB. Free memory was 123.7MB in the beginning and 121.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 277.88ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 110.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7043.92ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 110.3MB in the beginning and 64.2MB in the end (delta: 46.1MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 112.23ms. Allocated memory is still 205.5MB. Free memory was 64.2MB in the beginning and 169.0MB in the end (delta: -104.8MB). 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=21, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 952 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 400 IncrementalHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 200 mSDtfsCounter, 400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 574 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=9, InterpolantAutomatonStates: 111, 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, 9 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 2050 SizeOfPredicates, 20 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 610/1683 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-11 20:20:33,841 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE