./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/cggmp2005b.i -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 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:46:44,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:46:45,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:46:45,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:46:45,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:46:45,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:46:45,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:46:45,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:46:45,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:46:45,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:46:45,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:46:45,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:46:45,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:46:45,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:46:45,128 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:46:45,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:46:45,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:46:45,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:46:45,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:46:45,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:46:45,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:46:45,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:46:45,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:46:45,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:46:45,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:46:45,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:46:45,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:46:45,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:46:45,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:46:45,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:46:45,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:46:45,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:46:45,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:46:45,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:46:45,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:46:45,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:46:45,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:46:45,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:46:45,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:46:45,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:46:45,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:46:45,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:46:45,143 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 -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c [2024-11-11 19:46:45,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:46:45,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:46:45,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:46:45,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:46:45,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:46:45,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-11-11 19:46:46,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:46:47,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:46:47,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-11-11 19:46:47,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06f78a15/f78e41bc98c64e9d9868419c8c517012/FLAG2cc8d4195 [2024-11-11 19:46:47,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06f78a15/f78e41bc98c64e9d9868419c8c517012 [2024-11-11 19:46:47,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:46:47,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:46:47,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:46:47,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:46:47,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:46:47,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43353c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47, skipping insertion in model container [2024-11-11 19:46:47,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:46:47,304 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/loop-lit/cggmp2005b.i[895,908] [2024-11-11 19:46:47,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:46:47,322 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:46:47,332 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/loop-lit/cggmp2005b.i[895,908] [2024-11-11 19:46:47,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:46:47,351 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:46:47,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47 WrapperNode [2024-11-11 19:46:47,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:46:47,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:46:47,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:46:47,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:46:47,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,378 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-11 19:46:47,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:46:47,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:46:47,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:46:47,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:46:47,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,397 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 19:46:47,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:46:47,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:46:47,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:46:47,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:46:47,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (1/1) ... [2024-11-11 19:46:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:46:47,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:47,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:46:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:46:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:46:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:46:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:46:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:46:47,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:46:47,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:46:47,640 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-11 19:46:47,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:46:47,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:46:47,653 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 19:46:47,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:47 BoogieIcfgContainer [2024-11-11 19:46:47,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:46:47,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:46:47,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:46:47,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:46:47,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:46:47" (1/3) ... [2024-11-11 19:46:47,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7f653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:46:47, skipping insertion in model container [2024-11-11 19:46:47,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:46:47" (2/3) ... [2024-11-11 19:46:47,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7f653e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:46:47, skipping insertion in model container [2024-11-11 19:46:47,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:47" (3/3) ... [2024-11-11 19:46:47,663 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2024-11-11 19:46:47,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:46:47,675 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:46:47,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:46:47,728 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;@53aca991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:46:47,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:46:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-11 19:46:47,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:47,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-11 19:46:47,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash 890522599, now seen corresponding path program 1 times [2024-11-11 19:46:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:47,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730942722] [2024-11-11 19:46:47,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:47,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:47,915 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-11 19:46:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730942722] [2024-11-11 19:46:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730942722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:46:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137116783] [2024-11-11 19:46:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:46:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:46:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:46:47,970 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:47,983 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2024-11-11 19:46:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:46:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-11 19:46:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:47,994 INFO L225 Difference]: With dead ends: 26 [2024-11-11 19:46:47,995 INFO L226 Difference]: Without dead ends: 10 [2024-11-11 19:46:47,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:46:48,001 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:48,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-11 19:46:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-11 19:46:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-11 19:46:48,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2024-11-11 19:46:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:48,038 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-11 19:46:48,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2024-11-11 19:46:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-11 19:46:48,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:48,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-11 19:46:48,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:46:48,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:48,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 889658660, now seen corresponding path program 1 times [2024-11-11 19:46:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181573908] [2024-11-11 19:46:48,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:48,131 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-11 19:46:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181573908] [2024-11-11 19:46:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181573908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:46:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056811432] [2024-11-11 19:46:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:46:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:46:48,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:48,135 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:48,152 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-11 19:46:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:46:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-11 19:46:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:48,157 INFO L225 Difference]: With dead ends: 15 [2024-11-11 19:46:48,157 INFO L226 Difference]: Without dead ends: 11 [2024-11-11 19:46:48,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:48,159 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:48,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-11 19:46:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-11 19:46:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-11-11 19:46:48,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2024-11-11 19:46:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:48,172 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-11 19:46:48,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2024-11-11 19:46:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:46:48,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:48,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:48,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:46:48,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:48,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 385385298, now seen corresponding path program 1 times [2024-11-11 19:46:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630181733] [2024-11-11 19:46:48,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:46:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630181733] [2024-11-11 19:46:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630181733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:46:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780786225] [2024-11-11 19:46:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:46:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:46:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:48,251 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:48,260 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2024-11-11 19:46:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:46:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:46:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:48,261 INFO L225 Difference]: With dead ends: 20 [2024-11-11 19:46:48,261 INFO L226 Difference]: Without dead ends: 12 [2024-11-11 19:46:48,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:46:48,263 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:48,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-11 19:46:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-11 19:46:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-11 19:46:48,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2024-11-11 19:46:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:48,271 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-11 19:46:48,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-11-11 19:46:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:46:48,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:48,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:48,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:46:48,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:48,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1336595214, now seen corresponding path program 1 times [2024-11-11 19:46:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668639403] [2024-11-11 19:46:48,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:46:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668639403] [2024-11-11 19:46:48,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668639403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528042183] [2024-11-11 19:46:48,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:48,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:48,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:46:48,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:46:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:48,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 19:46:48,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:46:48,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:46:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528042183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:48,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 19:46:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457901892] [2024-11-11 19:46:48,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:46:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:46:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:48,524 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:48,569 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2024-11-11 19:46:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-11 19:46:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:48,573 INFO L225 Difference]: With dead ends: 28 [2024-11-11 19:46:48,573 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 19:46:48,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:46:48,574 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:48,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 19:46:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 19:46:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-11 19:46:48,589 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-11 19:46:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-11 19:46:48,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-11 19:46:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:46:48,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:48,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:48,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:46:48,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:48,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:48,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1732682136, now seen corresponding path program 2 times [2024-11-11 19:46:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:48,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006743391] [2024-11-11 19:46:48,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:46:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006743391] [2024-11-11 19:46:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006743391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022386025] [2024-11-11 19:46:48,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:46:48,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:48,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:46:48,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:46:48,963 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:46:48,964 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:46:48,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 19:46:48,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 19:46:49,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 19:46:49,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022386025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:49,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-11 19:46:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051852262] [2024-11-11 19:46:49,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:49,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:46:49,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:46:49,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:46:49,111 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:49,168 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-11-11 19:46:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:46:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-11 19:46:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:49,170 INFO L225 Difference]: With dead ends: 45 [2024-11-11 19:46:49,170 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 19:46:49,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:46:49,171 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:49,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 19:46:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 19:46:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-11-11 19:46:49,177 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 23 [2024-11-11 19:46:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:49,177 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-11 19:46:49,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-11 19:46:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 19:46:49,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:49,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:49,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:46:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:49,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2081085976, now seen corresponding path program 3 times [2024-11-11 19:46:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430974929] [2024-11-11 19:46:49,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 19:46:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430974929] [2024-11-11 19:46:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430974929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:46:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:46:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:46:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817170690] [2024-11-11 19:46:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:46:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:46:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:46:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:46:49,497 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:49,513 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2024-11-11 19:46:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:46:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 19:46:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:49,514 INFO L225 Difference]: With dead ends: 42 [2024-11-11 19:46:49,514 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:46:49,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:46:49,515 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:49,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:46:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:46:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:46:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:46:49,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-11 19:46:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:49,517 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:46:49,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:46:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:46:49,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:46:49,524 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:46:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:46:49,532 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-11-11 19:46:49,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:46:49,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:46:49,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:46:49 BoogieIcfgContainer [2024-11-11 19:46:49,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:46:49,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:46:49,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:46:49,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:46:49,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:46:47" (3/4) ... [2024-11-11 19:46:49,584 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:46:49,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-11 19:46:49,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:46:49,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:46:49,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:46:49,673 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:46:49,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:46:49,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:46:49,675 INFO L158 Benchmark]: Toolchain (without parser) took 2571.21ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 103.3MB in the beginning and 99.8MB in the end (delta: 3.5MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,675 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 157.3MB. Free memory was 118.6MB in the beginning and 118.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:46:49,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.04ms. Allocated memory is still 157.3MB. Free memory was 102.8MB in the beginning and 90.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 88.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:46:49,676 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,676 INFO L158 Benchmark]: RCFGBuilder took 247.46ms. Allocated memory is still 157.3MB. Free memory was 86.8MB in the beginning and 77.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,677 INFO L158 Benchmark]: TraceAbstraction took 1924.64ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.8MB in the beginning and 104.0MB in the end (delta: -27.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,677 INFO L158 Benchmark]: Witness Printer took 92.79ms. Allocated memory is still 203.4MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:46:49,678 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.23ms. Allocated memory is still 157.3MB. Free memory was 118.6MB in the beginning and 118.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.04ms. Allocated memory is still 157.3MB. Free memory was 102.8MB in the beginning and 90.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 157.3MB. Free memory was 90.2MB in the beginning and 88.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.46ms. Allocated memory is still 157.3MB. Free memory was 86.8MB in the beginning and 77.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1924.64ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.8MB in the beginning and 104.0MB in the end (delta: -27.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 92.79ms. Allocated memory is still 203.4MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 69 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 1 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 139/146 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (k == 4) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((k == 4) || (i < 2)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((k == 4) || ((i == 0) && (((long long) j + 100) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 19:46:49,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE