./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/bresenham-ll_unwindbound10.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 d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:18:05,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:18:05,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:18:05,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:18:05,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:18:05,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:18:05,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:18:05,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:18:05,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:18:05,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:18:05,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:18:05,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:18:05,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:18:05,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:18:05,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:18:05,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:18:05,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:18:05,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:18:05,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:18:05,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:18:05,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:18:05,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:18:05,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:18:05,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:18:05,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:18:05,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:18:05,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:18:05,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:18:05,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:18:05,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:18:05,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:18:05,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:18:05,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:18:05,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:18:05,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:18:05,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:18:05,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:18:05,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:18:05,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:18:05,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:18:05,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:18:05,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:18:05,375 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 -> d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f [2024-11-08 14:18:05,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:18:05,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:18:05,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:18:05,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:18:05,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:18:05,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-11-08 14:18:06,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:18:07,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:18:07,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-11-08 14:18:07,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a420b90f/4ba4f24483434a309c96d469b56fac9f/FLAG96709e2ba [2024-11-08 14:18:07,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a420b90f/4ba4f24483434a309c96d469b56fac9f [2024-11-08 14:18:07,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:18:07,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:18:07,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:18:07,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:18:07,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:18:07,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398f136b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07, skipping insertion in model container [2024-11-08 14:18:07,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:18:07,273 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/bresenham-ll_unwindbound10.c[597,610] [2024-11-08 14:18:07,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:18:07,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:18:07,298 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/bresenham-ll_unwindbound10.c[597,610] [2024-11-08 14:18:07,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:18:07,314 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:18:07,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07 WrapperNode [2024-11-08 14:18:07,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:18:07,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:18:07,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:18:07,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:18:07,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,341 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-08 14:18:07,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:18:07,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:18:07,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:18:07,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:18:07,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,366 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-08 14:18:07,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:18:07,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:18:07,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:18:07,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:18:07,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (1/1) ... [2024-11-08 14:18:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:18:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:07,398 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-08 14:18:07,400 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-08 14:18:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:18:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:18:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:18:07,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:18:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:18:07,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:18:07,497 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:18:07,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:18:07,596 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 14:18:07,596 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:18:07,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:18:07,606 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:18:07,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:07 BoogieIcfgContainer [2024-11-08 14:18:07,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:18:07,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:18:07,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:18:07,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:18:07,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:18:07" (1/3) ... [2024-11-08 14:18:07,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587d739d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:18:07, skipping insertion in model container [2024-11-08 14:18:07,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:07" (2/3) ... [2024-11-08 14:18:07,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587d739d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:18:07, skipping insertion in model container [2024-11-08 14:18:07,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:07" (3/3) ... [2024-11-08 14:18:07,614 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2024-11-08 14:18:07,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:18:07,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:18:07,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:18:07,672 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;@3ced0a79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:18:07,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:18:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:18:07,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:07,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:07,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2024-11-08 14:18:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783853903] [2024-11-08 14:18:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228007354] [2024-11-08 14:18:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:07,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:07,782 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-08 14:18:07,784 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-08 14:18:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:07,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:18:07,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:08,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:18:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783853903] [2024-11-08 14:18:08,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228007354] [2024-11-08 14:18:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228007354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:08,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:18:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819527426] [2024-11-08 14:18:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:08,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:18:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:18:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:18:08,043 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:18:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:08,162 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-08 14:18:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:18:08,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 14:18:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:08,186 INFO L225 Difference]: With dead ends: 52 [2024-11-08 14:18:08,186 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 14:18:08,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:18:08,193 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:08,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 14:18:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-08 14:18:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 14:18:08,260 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-08 14:18:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:08,260 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 14:18:08,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:18:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 14:18:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:18:08,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:08,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:08,276 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-08 14:18:08,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 14:18:08,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:08,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1226236780, now seen corresponding path program 1 times [2024-11-08 14:18:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745442339] [2024-11-08 14:18:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745442339] [2024-11-08 14:18:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745442339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:18:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025774760] [2024-11-08 14:18:08,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:08,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:18:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:18:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:18:08,567 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:18:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:08,580 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-08 14:18:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:18:08,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:18:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:08,582 INFO L225 Difference]: With dead ends: 31 [2024-11-08 14:18:08,582 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 14:18:08,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 14:18:08,583 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-08 14:18:08,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 14:18:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 14:18:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-08 14:18:08,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-08 14:18:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:08,588 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-08 14:18:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:18:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-08 14:18:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 14:18:08,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:08,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:08,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:18:08,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1414665262, now seen corresponding path program 1 times [2024-11-08 14:18:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659591123] [2024-11-08 14:18:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134346025] [2024-11-08 14:18:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:08,614 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-08 14:18:08,617 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-08 14:18:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:08,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:18:08,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:08,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:18:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659591123] [2024-11-08 14:18:08,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134346025] [2024-11-08 14:18:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134346025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:08,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:08,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:18:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17359215] [2024-11-08 14:18:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:08,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:18:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:08,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:18:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:18:08,788 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:18:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:08,857 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-08 14:18:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:18:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-08 14:18:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:08,858 INFO L225 Difference]: With dead ends: 33 [2024-11-08 14:18:08,858 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 14:18:08,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:18:08,860 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:08,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 14:18:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-08 14:18:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-08 14:18:08,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-08 14:18:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-08 14:18:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:18:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-08 14:18:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:18:08,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:08,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:08,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:09,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 14:18:09,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2024-11-08 14:18:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362606648] [2024-11-08 14:18:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120297980] [2024-11-08 14:18:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:09,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:09,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:09,123 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-08 14:18:09,125 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-08 14:18:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:09,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 14:18:09,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:09,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 14:18:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362606648] [2024-11-08 14:18:09,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120297980] [2024-11-08 14:18:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120297980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:09,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-08 14:18:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765802355] [2024-11-08 14:18:09,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:09,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:18:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:18:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:18:09,381 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:09,519 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-08 14:18:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 14:18:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-08 14:18:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:09,521 INFO L225 Difference]: With dead ends: 41 [2024-11-08 14:18:09,521 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 14:18:09,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:18:09,522 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:09,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 14:18:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-08 14:18:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-08 14:18:09,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-08 14:18:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-08 14:18:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:18:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-08 14:18:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 14:18:09,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:09,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:09,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:09,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:09,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:09,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 606185, now seen corresponding path program 1 times [2024-11-08 14:18:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44362379] [2024-11-08 14:18:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44362379] [2024-11-08 14:18:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44362379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699983359] [2024-11-08 14:18:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:09,812 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-08 14:18:09,813 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-08 14:18:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:09,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:18:09,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:09,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699983359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:09,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-08 14:18:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130824080] [2024-11-08 14:18:09,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:18:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:18:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:18:09,902 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:18:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:09,945 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-08 14:18:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:18:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-08 14:18:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:09,947 INFO L225 Difference]: With dead ends: 68 [2024-11-08 14:18:09,947 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 14:18:09,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:18:09,948 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:09,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 14:18:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-08 14:18:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:18:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-08 14:18:09,956 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-08 14:18:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:09,956 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-08 14:18:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:18:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 14:18:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 14:18:09,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:09,957 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:09,981 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-08 14:18:10,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:10,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:10,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1993750159, now seen corresponding path program 1 times [2024-11-08 14:18:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:10,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419241628] [2024-11-08 14:18:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495167633] [2024-11-08 14:18:10,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:10,189 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-08 14:18:10,190 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-08 14:18:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:10,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 14:18:10,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:18:10,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:18:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419241628] [2024-11-08 14:18:10,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495167633] [2024-11-08 14:18:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495167633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:10,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-08 14:18:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141837817] [2024-11-08 14:18:10,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:10,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:18:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:18:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:18:10,477 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:18:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:10,638 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-08 14:18:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:18:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-08 14:18:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:10,640 INFO L225 Difference]: With dead ends: 79 [2024-11-08 14:18:10,640 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 14:18:10,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:18:10,641 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:10,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 14:18:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-08 14:18:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:18:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-08 14:18:10,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-08 14:18:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:10,653 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-08 14:18:10,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:18:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-08 14:18:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 14:18:10,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:10,655 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:10,667 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-08 14:18:10,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:10,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:10,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2024-11-08 14:18:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494946254] [2024-11-08 14:18:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:10,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560162015] [2024-11-08 14:18:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:10,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:10,881 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-08 14:18:10,882 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-08 14:18:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:10,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 14:18:10,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:18:11,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:18:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494946254] [2024-11-08 14:18:14,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560162015] [2024-11-08 14:18:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560162015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:14,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-08 14:18:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081439998] [2024-11-08 14:18:14,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 14:18:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 14:18:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:18:14,144 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:18:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:15,327 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-08 14:18:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 14:18:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2024-11-08 14:18:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:15,328 INFO L225 Difference]: With dead ends: 86 [2024-11-08 14:18:15,328 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 14:18:15,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 14:18:15,329 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:15,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:18:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 14:18:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-08 14:18:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-08 14:18:15,342 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-08 14:18:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:15,342 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-08 14:18:15,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:18:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-08 14:18:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 14:18:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:15,343 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:15,356 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-08 14:18:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:15,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash 741920142, now seen corresponding path program 1 times [2024-11-08 14:18:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355584944] [2024-11-08 14:18:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355584944] [2024-11-08 14:18:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355584944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623368132] [2024-11-08 14:18:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:15,776 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-08 14:18:15,777 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-08 14:18:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 14:18:15,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:15,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623368132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:16,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-08 14:18:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491267617] [2024-11-08 14:18:16,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:18:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:18:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:18:16,024 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:16,151 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-08 14:18:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:18:16,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-08 14:18:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:16,153 INFO L225 Difference]: With dead ends: 88 [2024-11-08 14:18:16,153 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 14:18:16,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:18:16,154 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:16,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 14:18:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 14:18:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 14:18:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-08 14:18:16,167 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-08 14:18:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:16,167 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-08 14:18:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-08 14:18:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 14:18:16,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:16,168 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:16,181 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-08 14:18:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:16,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1464162251, now seen corresponding path program 2 times [2024-11-08 14:18:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512481989] [2024-11-08 14:18:16,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512481989] [2024-11-08 14:18:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512481989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084541191] [2024-11-08 14:18:16,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:18:16,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:16,521 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-08 14:18:16,522 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-08 14:18:16,592 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:18:16,592 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:16,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 14:18:16,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:16,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084541191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:16,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-08 14:18:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670782760] [2024-11-08 14:18:16,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:16,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 14:18:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:16,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 14:18:16,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:18:16,904 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 14:18:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:17,210 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-08 14:18:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 14:18:17,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 45 [2024-11-08 14:18:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:17,214 INFO L225 Difference]: With dead ends: 110 [2024-11-08 14:18:17,214 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 14:18:17,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-08 14:18:17,216 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:17,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 160 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 14:18:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-08 14:18:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 14:18:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-08 14:18:17,235 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-08 14:18:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-08 14:18:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 14:18:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-08 14:18:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 14:18:17,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:17,237 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:17,254 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-08 14:18:17,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 14:18:17,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2024-11-08 14:18:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614072057] [2024-11-08 14:18:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614072057] [2024-11-08 14:18:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614072057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812251482] [2024-11-08 14:18:17,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:18:17,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:17,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:17,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:18:17,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 14:18:17,604 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:18:17,605 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:17,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 14:18:17,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 14:18:18,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 14:18:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812251482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:24,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 12] total 26 [2024-11-08 14:18:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986143021] [2024-11-08 14:18:24,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 14:18:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 14:18:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=557, Unknown=2, NotChecked=0, Total=650 [2024-11-08 14:18:24,258 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:30,171 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2024-11-08 14:18:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 14:18:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2024-11-08 14:18:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:30,173 INFO L225 Difference]: With dead ends: 157 [2024-11-08 14:18:30,173 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 14:18:30,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=373, Invalid=1787, Unknown=2, NotChecked=0, Total=2162 [2024-11-08 14:18:30,174 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:30,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 213 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 14:18:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 14:18:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 62. [2024-11-08 14:18:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:18:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-08 14:18:30,193 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-08 14:18:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-08 14:18:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 10 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-08 14:18:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:18:30,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:30,195 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:30,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 14:18:30,399 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 2 times [2024-11-08 14:18:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827766955] [2024-11-08 14:18:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:30,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827766955] [2024-11-08 14:18:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827766955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473021302] [2024-11-08 14:18:30,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:18:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:30,546 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:18:30,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 14:18:30,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:18:30,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:30,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:18:30,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:18:30,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:18:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473021302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:30,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-08 14:18:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508487739] [2024-11-08 14:18:30,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:30,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:18:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:18:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:18:30,710 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-08 14:18:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:30,833 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-08 14:18:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:18:30,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 49 [2024-11-08 14:18:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:30,834 INFO L225 Difference]: With dead ends: 128 [2024-11-08 14:18:30,834 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 14:18:30,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:18:30,835 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:30,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 121 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 14:18:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-08 14:18:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 14:18:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-08 14:18:30,857 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-08 14:18:30,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:30,859 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-08 14:18:30,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-08 14:18:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-08 14:18:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:18:30,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:30,861 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:30,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 14:18:31,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 14:18:31,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:31,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 3 times [2024-11-08 14:18:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318703452] [2024-11-08 14:18:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665550866] [2024-11-08 14:18:31,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:18:31,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:31,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:31,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:18:31,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 14:18:31,223 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:18:31,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:31,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 14:18:31,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-08 14:18:31,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-08 14:18:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318703452] [2024-11-08 14:18:31,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665550866] [2024-11-08 14:18:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665550866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:31,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2024-11-08 14:18:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607419808] [2024-11-08 14:18:31,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:31,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 14:18:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 14:18:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:18:31,668 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:18:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:31,896 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2024-11-08 14:18:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:18:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 109 [2024-11-08 14:18:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:31,897 INFO L225 Difference]: With dead ends: 215 [2024-11-08 14:18:31,897 INFO L226 Difference]: Without dead ends: 209 [2024-11-08 14:18:31,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-08 14:18:31,898 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:31,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-08 14:18:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-08 14:18:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 165 states have (on average 1.121212121212121) internal successors, (185), 165 states have internal predecessors, (185), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 14:18:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 226 transitions. [2024-11-08 14:18:31,951 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 226 transitions. Word has length 109 [2024-11-08 14:18:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:31,952 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 226 transitions. [2024-11-08 14:18:31,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:18:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2024-11-08 14:18:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:18:31,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:31,953 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:31,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 14:18:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 14:18:32,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 977369872, now seen corresponding path program 1 times [2024-11-08 14:18:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416992081] [2024-11-08 14:18:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332405487] [2024-11-08 14:18:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:32,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:32,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:18:32,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 14:18:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:18:32,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 14:18:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:18:32,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 14:18:32,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 14:18:32,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:18:32,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 14:18:32,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 14:18:32,662 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:32,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:18:32,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:18:32 BoogieIcfgContainer [2024-11-08 14:18:32,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:18:32,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:18:32,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:18:32,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:18:32,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:07" (3/4) ... [2024-11-08 14:18:32,763 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 14:18:32,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:18:32,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:18:32,843 INFO L158 Benchmark]: Toolchain (without parser) took 25763.50ms. Allocated memory was 144.7MB in the beginning and 247.5MB in the end (delta: 102.8MB). Free memory was 72.8MB in the beginning and 177.3MB in the end (delta: -104.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:18:32,843 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:18:32,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.36ms. Allocated memory is still 144.7MB. Free memory was 72.5MB in the beginning and 112.0MB in the end (delta: -39.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 110.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,844 INFO L158 Benchmark]: Boogie Preprocessor took 31.29ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,844 INFO L158 Benchmark]: RCFGBuilder took 233.34ms. Allocated memory is still 144.7MB. Free memory was 108.4MB in the beginning and 97.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,844 INFO L158 Benchmark]: TraceAbstraction took 25147.21ms. Allocated memory was 144.7MB in the beginning and 247.5MB in the end (delta: 102.8MB). Free memory was 96.6MB in the beginning and 183.6MB in the end (delta: -87.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,845 INFO L158 Benchmark]: Witness Printer took 86.87ms. Allocated memory is still 247.5MB. Free memory was 183.6MB in the beginning and 177.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 14:18:32,846 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.15ms. Allocated memory is still 144.7MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.36ms. Allocated memory is still 144.7MB. Free memory was 72.5MB in the beginning and 112.0MB in the end (delta: -39.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 144.7MB. Free memory was 112.0MB in the beginning and 110.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.29ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 233.34ms. Allocated memory is still 144.7MB. Free memory was 108.4MB in the beginning and 97.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25147.21ms. Allocated memory was 144.7MB in the beginning and 247.5MB in the end (delta: 102.8MB). Free memory was 96.6MB in the beginning and 183.6MB in the end (delta: -87.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 86.87ms. Allocated memory is still 247.5MB. Free memory was 183.6MB in the beginning and 177.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=19, Y=1, counter=0, v=-17, x=0, y=0] [L31] EXPR counter++ VAL [X=19, Y=1, counter=1, v=-17, x=0, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=1, v=-17, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=1, v=-17, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=1, v=-17, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=1, v=-15, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=19, Y=1, counter=1, v=-15, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=19, Y=1, counter=2, v=-15, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=2, v=-15, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=2, v=-15, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=2, v=-15, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=2, v=-13, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=19, Y=1, counter=2, v=-13, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=19, Y=1, counter=3, v=-13, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=3, v=-13, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=3, v=-13, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=3, v=-13, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=3, v=-11, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=19, Y=1, counter=3, v=-11, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=19, Y=1, counter=4, v=-11, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=4, v=-11, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=4, v=-11, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=4, v=-11, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=4, v=-9, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=19, Y=1, counter=4, v=-9, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=19, Y=1, counter=5, v=-9, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=5, v=-9, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=5, v=-9, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=5, v=-9, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=5, v=-7, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=19, Y=1, counter=5, v=-7, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=19, Y=1, counter=6, v=-7, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=6, v=-7, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=6, v=-7, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=6, v=-7, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=6, v=-5, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=19, Y=1, counter=6, v=-5, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=19, Y=1, counter=7, v=-5, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=7, v=-5, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=7, v=-5, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=7, v=-5, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=7, v=-3, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=19, Y=1, counter=7, v=-3, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=19, Y=1, counter=8, v=-3, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=8, v=-3, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=8, v=-3, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=8, v=-3, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=8, v=-1, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=19, Y=1, counter=8, v=-1, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=19, Y=1, counter=9, v=-1, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=9, v=-1, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=9, v=-1, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=9, v=-1, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=19, Y=1, counter=9, v=1, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=19, Y=1, counter=9, v=1, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=19, Y=1, counter=10, v=1, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=19, Y=1, counter=10, v=1, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=19, Y=1, counter=10, v=1, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=19, Y=1, counter=10, v=1, x=9, xy=0, y=0, yx=9] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=19, Y=1, counter=10, v=-35, x=9, xy=0, y=1, yx=9] [L45] x++ VAL [X=19, Y=1, counter=10, v=-35, x=10, xy=0, y=1, yx=9] [L31] EXPR counter++ VAL [X=19, Y=1, counter=11, v=-35, x=10, xy=0, y=1, yx=9] [L31] COND FALSE !(counter++<10) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=19, Y=1, counter=11, v=-35, xy=10, y=1, yx=10] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=11] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L16] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 1227 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1591 IncrementalHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 177 mSDtfsCounter, 1591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 658 SyntacticMatches, 12 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=12, InterpolantAutomatonStates: 170, 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, 12 MinimizatonAttempts, 110 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 939 ConstructedInterpolants, 6 QuantifiedInterpolants, 4750 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1011 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 1360/1748 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-08 14:18:32,870 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