./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-19 21:09:52,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:09:52,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:09:52,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:09:52,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:09:52,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:09:52,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:09:52,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:09:52,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:09:52,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:09:52,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:09:52,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:09:52,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:09:52,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:09:52,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:09:52,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:09:52,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:09:52,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:09:52,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:09:52,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:09:52,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:09:52,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:09:52,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:09:52,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:09:52,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:09:52,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:09:52,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:09:52,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:09:52,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:09:52,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:09:52,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:09:52,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:09:52,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:09:52,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:09:52,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:09:52,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:09:52,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:09:52,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:09:52,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:09:52,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:09:52,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:09:52,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:09:52,878 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-19 21:09:53,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:09:53,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:09:53,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:09:53,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:09:53,187 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:09:53,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-11-19 21:09:54,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:09:54,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:09:54,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2024-11-19 21:09:54,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047ff4931/6ac0534adb3c433f9472dac736974eaf/FLAG91e874660 [2024-11-19 21:09:55,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047ff4931/6ac0534adb3c433f9472dac736974eaf [2024-11-19 21:09:55,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:09:55,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:09:55,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:09:55,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:09:55,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:09:55,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3682d3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55, skipping insertion in model container [2024-11-19 21:09:55,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:09:55,386 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-19 21:09:55,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:09:55,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:09:55,435 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-19 21:09:55,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:09:55,470 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:09:55,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55 WrapperNode [2024-11-19 21:09:55,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:09:55,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:09:55,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:09:55,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:09:55,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,502 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-19 21:09:55,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:09:55,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:09:55,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:09:55,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:09:55,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,526 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-19 21:09:55,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:09:55,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:09:55,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:09:55,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:09:55,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (1/1) ... [2024-11-19 21:09:55,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:09:55,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:55,586 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-19 21:09:55,592 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-19 21:09:55,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:09:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:09:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:09:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:09:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:09:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:09:55,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:09:55,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:09:55,886 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-19 21:09:55,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:09:55,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:09:55,900 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:09:55,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:09:55 BoogieIcfgContainer [2024-11-19 21:09:55,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:09:55,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:09:55,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:09:55,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:09:55,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:09:55" (1/3) ... [2024-11-19 21:09:55,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f93debd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:09:55, skipping insertion in model container [2024-11-19 21:09:55,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:09:55" (2/3) ... [2024-11-19 21:09:55,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f93debd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:09:55, skipping insertion in model container [2024-11-19 21:09:55,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:09:55" (3/3) ... [2024-11-19 21:09:55,911 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2024-11-19 21:09:55,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:09:55,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:09:55,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:09:55,998 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;@d74eb7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:09:55,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:09:56,004 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-19 21:09:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 21:09:56,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:56,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:56,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2024-11-19 21:09:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786374988] [2024-11-19 21:09:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:09:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767381577] [2024-11-19 21:09:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:56,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:56,164 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-19 21:09:56,166 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-19 21:09:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:56,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 21:09:56,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:09:56,450 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-19 21:09:56,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:09:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786374988] [2024-11-19 21:09:56,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:09:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767381577] [2024-11-19 21:09:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767381577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:09:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:09:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:09:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227204656] [2024-11-19 21:09:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:09:56,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:09:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:56,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:09:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:09:56,493 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-19 21:09:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:56,622 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-19 21:09:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:09:56,625 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-19 21:09:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:56,634 INFO L225 Difference]: With dead ends: 52 [2024-11-19 21:09:56,634 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 21:09:56,638 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-19 21:09:56,643 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-19 21:09:56,645 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-19 21:09:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 21:09:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-19 21:09:56,682 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-19 21:09:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-19 21:09:56,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-19 21:09:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:56,685 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-19 21:09:56,685 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-19 21:09:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-19 21:09:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 21:09:56,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:56,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:56,697 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-19 21:09:56,887 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-19 21:09:56,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1226236780, now seen corresponding path program 1 times [2024-11-19 21:09:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481971994] [2024-11-19 21:09:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:56,975 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-19 21:09:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:56,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481971994] [2024-11-19 21:09:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481971994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:09:56,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:09:56,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 21:09:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310087546] [2024-11-19 21:09:56,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:09:56,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:09:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:09:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:09:56,978 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-19 21:09:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:56,996 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-19 21:09:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:09:56,996 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-19 21:09:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:56,998 INFO L225 Difference]: With dead ends: 31 [2024-11-19 21:09:56,998 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 21:09:56,999 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-19 21:09:57,000 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-19 21:09:57,001 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-19 21:09:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 21:09:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 21:09:57,006 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-19 21:09:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-19 21:09:57,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-19 21:09:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:57,007 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-19 21:09:57,007 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-19 21:09:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-19 21:09:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 21:09:57,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:57,008 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:57,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:09:57,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:57,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1414665262, now seen corresponding path program 1 times [2024-11-19 21:09:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798432648] [2024-11-19 21:09:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:09:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181153865] [2024-11-19 21:09:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:57,038 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-19 21:09:57,046 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-19 21:09:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:57,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 21:09:57,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:09:57,227 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-19 21:09:57,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:09:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798432648] [2024-11-19 21:09:57,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:09:57,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181153865] [2024-11-19 21:09:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181153865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:09:57,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:09:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:09:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182612676] [2024-11-19 21:09:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:09:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:09:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:57,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:09:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:09:57,230 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-19 21:09:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:57,301 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-19 21:09:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:09:57,301 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-19 21:09:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:57,302 INFO L225 Difference]: With dead ends: 33 [2024-11-19 21:09:57,303 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 21:09:57,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-19 21:09:57,305 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-19 21:09:57,305 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-19 21:09:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 21:09:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-19 21:09:57,312 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-19 21:09:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-19 21:09:57,313 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-19 21:09:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:57,314 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-19 21:09:57,314 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-19 21:09:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-19 21:09:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 21:09:57,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:57,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:57,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:09:57,515 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-19 21:09:57,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2024-11-19 21:09:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:57,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409633992] [2024-11-19 21:09:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:09:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887727925] [2024-11-19 21:09:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:57,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:57,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:57,553 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-19 21:09:57,554 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-19 21:09:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:57,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 21:09:57,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:09:57,778 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-19 21:09:57,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:09:57,924 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-19 21:09:57,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:57,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409633992] [2024-11-19 21:09:57,924 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:09:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887727925] [2024-11-19 21:09:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887727925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:09:57,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:09:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-19 21:09:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12741011] [2024-11-19 21:09:57,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:09:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:09:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:09:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:09:57,928 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-19 21:09:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:58,130 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-19 21:09:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:09:58,131 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-19 21:09:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:58,132 INFO L225 Difference]: With dead ends: 41 [2024-11-19 21:09:58,132 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 21:09:58,132 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-19 21:09:58,133 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-19 21:09:58,134 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-19 21:09:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 21:09:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-19 21:09:58,140 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-19 21:09:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-19 21:09:58,141 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-19 21:09:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:58,142 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 21:09:58,142 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-19 21:09:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-19 21:09:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:09:58,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:58,143 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:58,151 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-19 21:09:58,346 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-19 21:09:58,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 606185, now seen corresponding path program 1 times [2024-11-19 21:09:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305825471] [2024-11-19 21:09:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:09:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:58,473 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-19 21:09:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305825471] [2024-11-19 21:09:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305825471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:09:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93766958] [2024-11-19 21:09:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:58,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:58,478 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-19 21:09:58,479 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-19 21:09:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:58,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 21:09:58,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:09:58,568 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-19 21:09:58,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:09:58,619 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-19 21:09:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93766958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:09:58,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:09:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-19 21:09:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756742464] [2024-11-19 21:09:58,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:09:58,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:09:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:09:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:09:58,624 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-19 21:09:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:58,708 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-19 21:09:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:09:58,712 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-19 21:09:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:58,713 INFO L225 Difference]: With dead ends: 68 [2024-11-19 21:09:58,713 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 21:09:58,713 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-19 21:09:58,714 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-19 21:09:58,715 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-19 21:09:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 21:09:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-19 21:09:58,738 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-19 21:09:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-19 21:09:58,740 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-19 21:09:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:58,741 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-19 21:09:58,741 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-19 21:09:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-19 21:09:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 21:09:58,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:58,742 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:58,752 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-19 21:09:58,943 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-19 21:09:58,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:58,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1993750159, now seen corresponding path program 1 times [2024-11-19 21:09:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903207263] [2024-11-19 21:09:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:09:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649945905] [2024-11-19 21:09:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:58,986 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-19 21:09:58,988 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-19 21:09:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:59,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 21:09:59,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:09:59,213 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-19 21:09:59,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:09:59,356 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-19 21:09:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:09:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903207263] [2024-11-19 21:09:59,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:09:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649945905] [2024-11-19 21:09:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649945905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:09:59,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:09:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-19 21:09:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772768642] [2024-11-19 21:09:59,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:09:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:09:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:09:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:09:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:09:59,359 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-19 21:09:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:09:59,537 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-19 21:09:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:09:59,538 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-19 21:09:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:09:59,539 INFO L225 Difference]: With dead ends: 79 [2024-11-19 21:09:59,539 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 21:09:59,539 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-19 21:09:59,541 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-19 21:09:59,541 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-19 21:09:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 21:09:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-19 21:09:59,564 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-19 21:09:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-19 21:09:59,566 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-19 21:09:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:09:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-19 21:09:59,567 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-19 21:09:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-19 21:09:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 21:09:59,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:09:59,568 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:09:59,577 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-19 21:09:59,769 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-19 21:09:59,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:09:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:09:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2024-11-19 21:09:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:09:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330595661] [2024-11-19 21:09:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:09:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:09:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923094839] [2024-11-19 21:09:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:09:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:09:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:09:59,798 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-19 21:09:59,802 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-19 21:09:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:09:59,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 21:09:59,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:00,287 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-19 21:10:00,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:02,594 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-19 21:10:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330595661] [2024-11-19 21:10:02,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:10:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923094839] [2024-11-19 21:10:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923094839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:02,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:10:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-19 21:10:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249235588] [2024-11-19 21:10:02,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 21:10:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 21:10:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:10:02,596 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-19 21:10:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:04,792 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-19 21:10:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 21:10:04,796 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-19 21:10:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:04,797 INFO L225 Difference]: With dead ends: 86 [2024-11-19 21:10:04,797 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 21:10:04,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 21:10:04,799 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:10:04,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:10:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 21:10:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-19 21:10:04,823 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-19 21:10:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-19 21:10:04,827 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-19 21:10:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:04,827 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-19 21:10:04,827 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-19 21:10:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-19 21:10:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 21:10:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:04,829 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-19 21:10:04,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 21:10:05,029 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-19 21:10:05,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 741920142, now seen corresponding path program 1 times [2024-11-19 21:10:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148661152] [2024-11-19 21:10:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:10:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:10:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:10:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:05,248 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-19 21:10:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148661152] [2024-11-19 21:10:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148661152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:10:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447711494] [2024-11-19 21:10:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:05,252 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-19 21:10:05,253 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-19 21:10:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:05,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:10:05,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:05,409 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-19 21:10:05,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:05,541 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-19 21:10:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447711494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:05,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:10:05,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-19 21:10:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984615351] [2024-11-19 21:10:05,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:05,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:10:05,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:10:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:10:05,545 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-19 21:10:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:05,707 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-19 21:10:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:10:05,708 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-19 21:10:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:05,709 INFO L225 Difference]: With dead ends: 88 [2024-11-19 21:10:05,710 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 21:10:05,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:10:05,714 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-19 21:10:05,714 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-19 21:10:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 21:10:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 21:10:05,737 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-19 21:10:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-19 21:10:05,740 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-19 21:10:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:05,741 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-19 21:10:05,741 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-19 21:10:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-19 21:10:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 21:10:05,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:05,742 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-19 21:10:05,750 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-19 21:10:05,943 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-19 21:10:05,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:05,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1464162251, now seen corresponding path program 2 times [2024-11-19 21:10:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889349747] [2024-11-19 21:10:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:10:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:10:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:10:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:10:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:06,130 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-19 21:10:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889349747] [2024-11-19 21:10:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889349747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:10:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155719739] [2024-11-19 21:10:06,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:10:06,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:06,133 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-19 21:10:06,135 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-19 21:10:06,179 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:10:06,180 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:10:06,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 21:10:06,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:06,344 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-19 21:10:06,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:06,549 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-19 21:10:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155719739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:06,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:10:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-19 21:10:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521479829] [2024-11-19 21:10:06,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 21:10:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 21:10:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-19 21:10:06,554 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-19 21:10:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:06,932 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-19 21:10:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 21:10:06,932 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-19 21:10:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:06,934 INFO L225 Difference]: With dead ends: 110 [2024-11-19 21:10:06,934 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 21:10:06,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-19 21:10:06,935 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:10:06,935 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.2s Time] [2024-11-19 21:10:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 21:10:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-19 21:10:06,952 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-19 21:10:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-19 21:10:06,953 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-19 21:10:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-19 21:10:06,954 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-19 21:10:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-19 21:10:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 21:10:06,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:06,956 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-19 21:10:06,964 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-19 21:10:07,156 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-19 21:10:07,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2024-11-19 21:10:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452057052] [2024-11-19 21:10:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:10:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:10:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:10:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:10:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:07,235 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-19 21:10:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452057052] [2024-11-19 21:10:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452057052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:10:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698324642] [2024-11-19 21:10:07,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 21:10:07,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:07,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:07,238 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-19 21:10:07,239 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-19 21:10:07,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 21:10:07,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:10:07,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 21:10:07,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:07,479 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-19 21:10:07,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:07,666 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-19 21:10:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698324642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:07,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:10:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 21 [2024-11-19 21:10:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311251415] [2024-11-19 21:10:07,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:07,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 21:10:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 21:10:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-19 21:10:07,668 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 21:10:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:08,262 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-11-19 21:10:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 21:10:08,262 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 45 [2024-11-19 21:10:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:08,263 INFO L225 Difference]: With dead ends: 134 [2024-11-19 21:10:08,263 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 21:10:08,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 21:10:08,265 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:10:08,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:10:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 21:10:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 62. [2024-11-19 21:10:08,279 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-19 21:10:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-19 21:10:08,280 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-19 21:10:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:08,280 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-19 21:10:08,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 21:10:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-19 21:10:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 21:10:08,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:08,282 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:10:08,286 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-19 21:10:08,482 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-19 21:10:08,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 2 times [2024-11-19 21:10:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473724166] [2024-11-19 21:10:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:10:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:10:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:10:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:10:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:10:08,597 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-19 21:10:08,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473724166] [2024-11-19 21:10:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473724166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:10:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545619949] [2024-11-19 21:10:08,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:10:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:08,600 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-19 21:10:08,602 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-19 21:10:08,647 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:10:08,647 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:10:08,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:10:08,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:08,703 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-19 21:10:08,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:08,800 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-19 21:10:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545619949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:08,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:10:08,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-19 21:10:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934924155] [2024-11-19 21:10:08,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:08,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:10:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:10:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:10:08,802 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-19 21:10:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:08,923 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-19 21:10:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 21:10:08,923 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-19 21:10:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:08,925 INFO L225 Difference]: With dead ends: 128 [2024-11-19 21:10:08,925 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 21:10:08,925 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-19 21:10:08,926 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:10:08,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:10:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 21:10:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 21:10:08,950 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-19 21:10:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-19 21:10:08,951 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-19 21:10:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-19 21:10:08,951 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-19 21:10:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-19 21:10:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:10:08,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:08,954 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:10:08,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 21:10:09,154 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-19 21:10:09,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 3 times [2024-11-19 21:10:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363534954] [2024-11-19 21:10:09,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:10:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288283281] [2024-11-19 21:10:09,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 21:10:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:09,227 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-19 21:10:09,228 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-19 21:10:09,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 21:10:09,272 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:10:09,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 21:10:09,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:10:09,462 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-19 21:10:09,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:10:09,683 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-19 21:10:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:10:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363534954] [2024-11-19 21:10:09,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:10:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288283281] [2024-11-19 21:10:09,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288283281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:10:09,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:10:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2024-11-19 21:10:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123361145] [2024-11-19 21:10:09,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:10:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:10:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:10:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:10:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:10:09,685 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-19 21:10:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:10:09,832 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2024-11-19 21:10:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:10:09,832 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-19 21:10:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:10:09,833 INFO L225 Difference]: With dead ends: 215 [2024-11-19 21:10:09,834 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 21:10:09,834 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-19 21:10:09,834 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:10:09,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:10:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 21:10:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-19 21:10:09,869 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-19 21:10:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 226 transitions. [2024-11-19 21:10:09,870 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 226 transitions. Word has length 109 [2024-11-19 21:10:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:10:09,871 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 226 transitions. [2024-11-19 21:10:09,871 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-19 21:10:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2024-11-19 21:10:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:10:09,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:10:09,873 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-19 21:10:09,880 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-19 21:10:10,073 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-19 21:10:10,073 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:10:10,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:10:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash 977369872, now seen corresponding path program 1 times [2024-11-19 21:10:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:10:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48667651] [2024-11-19 21:10:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:10:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:10:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102477127] [2024-11-19 21:10:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:10:10,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:10:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:10:10,131 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-19 21:10:10,145 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-19 21:10:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 21:10:10,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 21:10:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 21:10:10,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 21:10:10,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 21:10:10,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:10:10,320 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-19 21:10:10,512 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-19 21:10:10,515 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:10:10,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 21:10:10,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:10:10 BoogieIcfgContainer [2024-11-19 21:10:10,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 21:10:10,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 21:10:10,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 21:10:10,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 21:10:10,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:09:55" (3/4) ... [2024-11-19 21:10:10,596 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 21:10:10,680 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 21:10:10,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 21:10:10,681 INFO L158 Benchmark]: Toolchain (without parser) took 15505.87ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 137.2MB in the beginning and 113.8MB in the end (delta: 23.4MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,681 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:10:10,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.92ms. Allocated memory is still 165.7MB. Free memory was 137.2MB in the beginning and 124.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.75ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 122.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,682 INFO L158 Benchmark]: Boogie Preprocessor took 35.81ms. Allocated memory is still 165.7MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:10:10,682 INFO L158 Benchmark]: RCFGBuilder took 360.97ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 109.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,682 INFO L158 Benchmark]: TraceAbstraction took 14690.11ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 109.0MB in the beginning and 119.1MB in the end (delta: -10.1MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,683 INFO L158 Benchmark]: Witness Printer took 85.67ms. Allocated memory is still 199.2MB. Free memory was 119.1MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 21:10:10,684 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.17ms. Allocated memory is still 165.7MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.92ms. Allocated memory is still 165.7MB. Free memory was 137.2MB in the beginning and 124.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.75ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 122.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.81ms. Allocated memory is still 165.7MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.97ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 109.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14690.11ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 109.0MB in the beginning and 119.1MB in the end (delta: -10.1MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 85.67ms. Allocated memory is still 199.2MB. Free memory was 119.1MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 14.5s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 1184 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1007 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1510 IncrementalHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 177 mSDtfsCounter, 1510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 660 SyntacticMatches, 14 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=12, InterpolantAutomatonStates: 165, 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, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 939 ConstructedInterpolants, 2 QuantifiedInterpolants, 4373 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1011 ConjunctsInSsa, 167 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-19 21:10:10,711 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