./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/eca-rers2012/Problem10_label19.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 8d19293d6c97292eadc216d0bdf76553228738bf7b7f58bcd2246dd2ebdace18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:25:43,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:25:43,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:25:43,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:25:43,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:25:43,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:25:43,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:25:43,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:25:43,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:25:43,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:25:43,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:25:43,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:25:43,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:25:43,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:25:43,569 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:25:43,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:25:43,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:25:43,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:25:43,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:25:43,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:25:43,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:25:43,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:25:43,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:25:43,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:25:43,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:25:43,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:25:43,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:25:43,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:25:43,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:25:43,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:25:43,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:25:43,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:25:43,578 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 -> 8d19293d6c97292eadc216d0bdf76553228738bf7b7f58bcd2246dd2ebdace18 [2024-10-13 23:25:43,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:25:43,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:25:43,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:25:43,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:25:43,798 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:25:43,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c [2024-10-13 23:25:45,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:25:45,224 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:25:45,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c [2024-10-13 23:25:45,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7884716/0b0d95122afc42008fe26f5ae6e48f80/FLAG5e2a58379 [2024-10-13 23:25:45,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7884716/0b0d95122afc42008fe26f5ae6e48f80 [2024-10-13 23:25:45,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:25:45,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:25:45,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:25:45,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:25:45,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:25:45,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecbd066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45, skipping insertion in model container [2024-10-13 23:25:45,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:25:45,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c[3486,3499] [2024-10-13 23:25:45,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:25:45,610 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:25:45,627 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c[3486,3499] [2024-10-13 23:25:45,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:25:45,685 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:25:45,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45 WrapperNode [2024-10-13 23:25:45,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:25:45,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:25:45,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:25:45,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:25:45,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,766 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-13 23:25:45,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:25:45,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:25:45,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:25:45,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:25:45,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,816 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-10-13 23:25:45,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:25:45,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:25:45,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:25:45,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:25:45,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (1/1) ... [2024-10-13 23:25:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:25:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:45,890 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-10-13 23:25:45,891 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-10-13 23:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:25:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:25:45,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:25:45,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:25:45,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:25:46,811 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-13 23:25:46,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:25:46,845 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:25:46,846 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:25:46,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:25:46 BoogieIcfgContainer [2024-10-13 23:25:46,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:25:46,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:25:46,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:25:46,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:25:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:25:45" (1/3) ... [2024-10-13 23:25:46,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee84de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:25:46, skipping insertion in model container [2024-10-13 23:25:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:25:45" (2/3) ... [2024-10-13 23:25:46,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee84de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:25:46, skipping insertion in model container [2024-10-13 23:25:46,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:25:46" (3/3) ... [2024-10-13 23:25:46,856 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label19.c [2024-10-13 23:25:46,868 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:25:46,868 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:25:46,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:25:46,925 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;@6ffe2b4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:25:46,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:25:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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-10-13 23:25:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 23:25:46,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:46,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:46,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -240130059, now seen corresponding path program 1 times [2024-10-13 23:25:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968102525] [2024-10-13 23:25:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968102525] [2024-10-13 23:25:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968102525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:47,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:25:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611952683] [2024-10-13 23:25:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:25:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:25:47,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:25:47,094 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 23:25:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:47,126 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-13 23:25:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:25:47,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 28 [2024-10-13 23:25:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:47,136 INFO L225 Difference]: With dead ends: 287 [2024-10-13 23:25:47,136 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 23:25:47,139 INFO L431 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-10-13 23:25:47,143 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:47,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:25:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 23:25:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 23:25:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-10-13 23:25:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-13 23:25:47,174 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 28 [2024-10-13 23:25:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-13 23:25:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 23:25:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-13 23:25:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 23:25:47,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:47,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:25:47,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 489842301, now seen corresponding path program 1 times [2024-10-13 23:25:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519460622] [2024-10-13 23:25:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519460622] [2024-10-13 23:25:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519460622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:25:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857300498] [2024-10-13 23:25:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:47,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:47,319 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 23:25:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:47,818 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-13 23:25:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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 28 [2024-10-13 23:25:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:47,820 INFO L225 Difference]: With dead ends: 283 [2024-10-13 23:25:47,820 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 23:25:47,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-13 23:25:47,824 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:47,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 9 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:25:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 23:25:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-13 23:25:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-10-13 23:25:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-13 23:25:47,850 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 28 [2024-10-13 23:25:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:47,850 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-13 23:25:47,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 23:25:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-13 23:25:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 23:25:47,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:47,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:47,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:25:47,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1009330896, now seen corresponding path program 1 times [2024-10-13 23:25:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430945663] [2024-10-13 23:25:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 23:25:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430945663] [2024-10-13 23:25:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430945663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372518765] [2024-10-13 23:25:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:48,144 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-10-13 23:25:48,146 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-10-13 23:25:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:48,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:48,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:48,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372518765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 23:25:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661585783] [2024-10-13 23:25:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:48,271 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 23:25:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:48,694 INFO L93 Difference]: Finished difference Result 839 states and 1290 transitions. [2024-10-13 23:25:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-10-13 23:25:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:48,697 INFO L225 Difference]: With dead ends: 839 [2024-10-13 23:25:48,697 INFO L226 Difference]: Without dead ends: 559 [2024-10-13 23:25:48,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:48,699 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:48,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 223 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-13 23:25:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-13 23:25:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3781362007168458) internal successors, (769), 558 states have internal predecessors, (769), 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-10-13 23:25:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 769 transitions. [2024-10-13 23:25:48,724 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 769 transitions. Word has length 94 [2024-10-13 23:25:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:48,724 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 769 transitions. [2024-10-13 23:25:48,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 23:25:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 769 transitions. [2024-10-13 23:25:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 23:25:48,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:48,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:48,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:25:48,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:48,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:48,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1419037567, now seen corresponding path program 1 times [2024-10-13 23:25:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230959015] [2024-10-13 23:25:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:49,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230959015] [2024-10-13 23:25:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230959015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:49,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:25:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107210744] [2024-10-13 23:25:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:49,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:49,035 INFO L87 Difference]: Start difference. First operand 559 states and 769 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10-13 23:25:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:49,368 INFO L93 Difference]: Finished difference Result 1395 states and 1966 transitions. [2024-10-13 23:25:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-13 23:25:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:49,371 INFO L225 Difference]: With dead ends: 1395 [2024-10-13 23:25:49,371 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 23:25:49,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-13 23:25:49,373 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:49,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 63 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:25:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 23:25:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-13 23:25:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3014354066985645) internal successors, (1088), 836 states have internal predecessors, (1088), 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-10-13 23:25:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1088 transitions. [2024-10-13 23:25:49,387 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1088 transitions. Word has length 105 [2024-10-13 23:25:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:49,387 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1088 transitions. [2024-10-13 23:25:49,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10-13 23:25:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1088 transitions. [2024-10-13 23:25:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 23:25:49,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:49,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:25:49,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -410264262, now seen corresponding path program 1 times [2024-10-13 23:25:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416605646] [2024-10-13 23:25:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:49,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416605646] [2024-10-13 23:25:49,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416605646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:49,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682535769] [2024-10-13 23:25:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:49,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:25:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:25:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:25:49,644 INFO L87 Difference]: Start difference. First operand 837 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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-10-13 23:25:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:50,066 INFO L93 Difference]: Finished difference Result 1812 states and 2334 transitions. [2024-10-13 23:25:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:25:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2024-10-13 23:25:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:50,069 INFO L225 Difference]: With dead ends: 1812 [2024-10-13 23:25:50,069 INFO L226 Difference]: Without dead ends: 976 [2024-10-13 23:25:50,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:50,072 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:50,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 83 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-13 23:25:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-13 23:25:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2635897435897436) internal successors, (1232), 975 states have internal predecessors, (1232), 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-10-13 23:25:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1232 transitions. [2024-10-13 23:25:50,090 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1232 transitions. Word has length 115 [2024-10-13 23:25:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:50,091 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1232 transitions. [2024-10-13 23:25:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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-10-13 23:25:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1232 transitions. [2024-10-13 23:25:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 23:25:50,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:50,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:50,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:25:50,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -3695679, now seen corresponding path program 1 times [2024-10-13 23:25:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115117059] [2024-10-13 23:25:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115117059] [2024-10-13 23:25:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115117059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:50,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:50,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836575809] [2024-10-13 23:25:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:50,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:50,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:50,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:50,256 INFO L87 Difference]: Start difference. First operand 976 states and 1232 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-13 23:25:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:50,644 INFO L93 Difference]: Finished difference Result 2090 states and 2657 transitions. [2024-10-13 23:25:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 172 [2024-10-13 23:25:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:50,648 INFO L225 Difference]: With dead ends: 2090 [2024-10-13 23:25:50,648 INFO L226 Difference]: Without dead ends: 1254 [2024-10-13 23:25:50,649 INFO L431 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-10-13 23:25:50,650 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:50,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-13 23:25:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-13 23:25:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2210694333599361) internal successors, (1530), 1253 states have internal predecessors, (1530), 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-10-13 23:25:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1530 transitions. [2024-10-13 23:25:50,678 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1530 transitions. Word has length 172 [2024-10-13 23:25:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1530 transitions. [2024-10-13 23:25:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-13 23:25:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1530 transitions. [2024-10-13 23:25:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 23:25:50,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:50,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:25:50,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:50,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash 712016203, now seen corresponding path program 1 times [2024-10-13 23:25:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231736558] [2024-10-13 23:25:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 23:25:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231736558] [2024-10-13 23:25:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231736558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142422570] [2024-10-13 23:25:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:50,852 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-10-13 23:25:50,853 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-10-13 23:25:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:50,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:50,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 23:25:51,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142422570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:25:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663802026] [2024-10-13 23:25:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:51,155 INFO L87 Difference]: Start difference. First operand 1254 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-10-13 23:25:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:51,536 INFO L93 Difference]: Finished difference Result 2368 states and 2915 transitions. [2024-10-13 23:25:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 176 [2024-10-13 23:25:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:51,542 INFO L225 Difference]: With dead ends: 2368 [2024-10-13 23:25:51,542 INFO L226 Difference]: Without dead ends: 2366 [2024-10-13 23:25:51,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:51,543 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:51,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 69 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-10-13 23:25:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 976. [2024-10-13 23:25:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.243076923076923) internal successors, (1212), 975 states have internal predecessors, (1212), 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-10-13 23:25:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1212 transitions. [2024-10-13 23:25:51,561 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1212 transitions. Word has length 176 [2024-10-13 23:25:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1212 transitions. [2024-10-13 23:25:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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-10-13 23:25:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1212 transitions. [2024-10-13 23:25:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 23:25:51,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:51,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:51,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:25:51,763 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,SelfDestructingSolverStorable6 [2024-10-13 23:25:51,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 811899373, now seen corresponding path program 1 times [2024-10-13 23:25:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877668526] [2024-10-13 23:25:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877668526] [2024-10-13 23:25:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877668526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 23:25:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669628828] [2024-10-13 23:25:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:52,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 23:25:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 23:25:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:52,061 INFO L87 Difference]: Start difference. First operand 976 states and 1212 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 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-10-13 23:25:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:52,530 INFO L93 Difference]: Finished difference Result 1867 states and 2334 transitions. [2024-10-13 23:25:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 23:25:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 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 181 [2024-10-13 23:25:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:52,533 INFO L225 Difference]: With dead ends: 1867 [2024-10-13 23:25:52,533 INFO L226 Difference]: Without dead ends: 976 [2024-10-13 23:25:52,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:52,535 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:52,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 28 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:25:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-13 23:25:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-13 23:25:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2379487179487179) internal successors, (1207), 975 states have internal predecessors, (1207), 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-10-13 23:25:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1207 transitions. [2024-10-13 23:25:52,551 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1207 transitions. Word has length 181 [2024-10-13 23:25:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:52,551 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1207 transitions. [2024-10-13 23:25:52,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 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-10-13 23:25:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2024-10-13 23:25:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-13 23:25:52,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:52,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:52,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:25:52,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:52,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1681667321, now seen corresponding path program 1 times [2024-10-13 23:25:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394240369] [2024-10-13 23:25:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394240369] [2024-10-13 23:25:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394240369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478560081] [2024-10-13 23:25:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:52,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:52,684 INFO L87 Difference]: Start difference. First operand 976 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-10-13 23:25:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:53,019 INFO L93 Difference]: Finished difference Result 1812 states and 2270 transitions. [2024-10-13 23:25:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:53,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 217 [2024-10-13 23:25:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:53,022 INFO L225 Difference]: With dead ends: 1812 [2024-10-13 23:25:53,022 INFO L226 Difference]: Without dead ends: 976 [2024-10-13 23:25:53,023 INFO L431 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-10-13 23:25:53,024 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:53,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:25:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-13 23:25:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 837. [2024-10-13 23:25:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.1411483253588517) internal successors, (954), 836 states have internal predecessors, (954), 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-10-13 23:25:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 954 transitions. [2024-10-13 23:25:53,034 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 954 transitions. Word has length 217 [2024-10-13 23:25:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:53,035 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 954 transitions. [2024-10-13 23:25:53,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-10-13 23:25:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 954 transitions. [2024-10-13 23:25:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-13 23:25:53,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:53,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:25:53,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1362245899, now seen corresponding path program 1 times [2024-10-13 23:25:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216095486] [2024-10-13 23:25:53,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 68 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216095486] [2024-10-13 23:25:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216095486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299789511] [2024-10-13 23:25:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:53,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:53,330 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-10-13 23:25:53,331 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-10-13 23:25:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:53,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:53,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-13 23:25:53,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:53,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299789511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:53,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:53,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-13 23:25:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125763105] [2024-10-13 23:25:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:53,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:53,628 INFO L87 Difference]: Start difference. First operand 837 states and 954 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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-10-13 23:25:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:53,957 INFO L93 Difference]: Finished difference Result 1812 states and 2096 transitions. [2024-10-13 23:25:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 261 [2024-10-13 23:25:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:53,961 INFO L225 Difference]: With dead ends: 1812 [2024-10-13 23:25:53,961 INFO L226 Difference]: Without dead ends: 1115 [2024-10-13 23:25:53,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:53,963 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:53,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:25:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-13 23:25:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-13 23:25:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.118491921005386) internal successors, (1246), 1114 states have internal predecessors, (1246), 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-10-13 23:25:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1246 transitions. [2024-10-13 23:25:53,975 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1246 transitions. Word has length 261 [2024-10-13 23:25:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:53,976 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1246 transitions. [2024-10-13 23:25:53,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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-10-13 23:25:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1246 transitions. [2024-10-13 23:25:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-13 23:25:53,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:53,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:53,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:25:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:54,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1976795987, now seen corresponding path program 1 times [2024-10-13 23:25:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785314310] [2024-10-13 23:25:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 23:25:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785314310] [2024-10-13 23:25:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785314310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210849328] [2024-10-13 23:25:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:54,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:54,371 INFO L87 Difference]: Start difference. First operand 1115 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-10-13 23:25:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:54,731 INFO L93 Difference]: Finished difference Result 2785 states and 3142 transitions. [2024-10-13 23:25:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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 329 [2024-10-13 23:25:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:54,736 INFO L225 Difference]: With dead ends: 2785 [2024-10-13 23:25:54,736 INFO L226 Difference]: Without dead ends: 1810 [2024-10-13 23:25:54,737 INFO L431 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-10-13 23:25:54,738 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:54,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 202 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:25:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-13 23:25:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-10-13 23:25:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.1033720287451632) internal successors, (1996), 1809 states have internal predecessors, (1996), 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-10-13 23:25:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 1996 transitions. [2024-10-13 23:25:54,759 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 1996 transitions. Word has length 329 [2024-10-13 23:25:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:54,759 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 1996 transitions. [2024-10-13 23:25:54,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-10-13 23:25:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 1996 transitions. [2024-10-13 23:25:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-13 23:25:54,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:54,764 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:54,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:25:54,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:54,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1166562929, now seen corresponding path program 1 times [2024-10-13 23:25:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:54,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967494093] [2024-10-13 23:25:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-13 23:25:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967494093] [2024-10-13 23:25:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967494093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277989825] [2024-10-13 23:25:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:55,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:55,049 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-10-13 23:25:55,050 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-10-13 23:25:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:55,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:55,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-13 23:25:55,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277989825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:25:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24756491] [2024-10-13 23:25:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:25:55,190 INFO L87 Difference]: Start difference. First operand 1810 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-13 23:25:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:55,531 INFO L93 Difference]: Finished difference Result 3617 states and 4016 transitions. [2024-10-13 23:25:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 342 [2024-10-13 23:25:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:55,532 INFO L225 Difference]: With dead ends: 3617 [2024-10-13 23:25:55,532 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:25:55,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:25:55,534 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:55,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 219 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:25:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:25:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:25:55,535 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-10-13 23:25:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:25:55,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2024-10-13 23:25:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:55,535 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:25:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-13 23:25:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:25:55,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:25:55,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:25:55,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:25:55,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:55,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:55,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:25:55,873 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:25:55,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:25:55 BoogieIcfgContainer [2024-10-13 23:25:55,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:25:55,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:25:55,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:25:55,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:25:55,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:25:46" (3/4) ... [2024-10-13 23:25:55,886 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:25:55,897 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:25:55,898 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:25:55,899 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:25:55,900 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:25:56,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:25:56,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:25:56,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:25:56,026 INFO L158 Benchmark]: Toolchain (without parser) took 10771.73ms. Allocated memory was 169.9MB in the beginning and 325.1MB in the end (delta: 155.2MB). Free memory was 97.3MB in the beginning and 213.9MB in the end (delta: -116.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,026 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory was 132.2MB in the beginning and 132.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:25:56,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.56ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 115.1MB in the end (delta: -18.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.53ms. Allocated memory is still 169.9MB. Free memory was 115.1MB in the beginning and 106.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,030 INFO L158 Benchmark]: Boogie Preprocessor took 96.33ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 96.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,030 INFO L158 Benchmark]: RCFGBuilder took 982.58ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 96.9MB in the beginning and 109.4MB in the end (delta: -12.6MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,030 INFO L158 Benchmark]: TraceAbstraction took 9036.89ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 109.4MB in the beginning and 225.4MB in the end (delta: -116.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:25:56,031 INFO L158 Benchmark]: Witness Printer took 140.66ms. Allocated memory is still 325.1MB. Free memory was 225.4MB in the beginning and 213.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:25:56,032 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.13ms. Allocated memory is still 169.9MB. Free memory was 132.2MB in the beginning and 132.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.56ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 115.1MB in the end (delta: -18.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.53ms. Allocated memory is still 169.9MB. Free memory was 115.1MB in the beginning and 106.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.33ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 96.9MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 982.58ms. Allocated memory was 169.9MB in the beginning and 224.4MB in the end (delta: 54.5MB). Free memory was 96.9MB in the beginning and 109.4MB in the end (delta: -12.6MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9036.89ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 109.4MB in the beginning and 225.4MB in the end (delta: -116.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 140.66ms. Allocated memory is still 325.1MB. Free memory was 225.4MB in the beginning and 213.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 101]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 1544 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4766 IncrementalHoareTripleChecker+Invalid, 5314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 1483 mSDtfsCounter, 4766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1810occurred in iteration=11, InterpolantAutomatonStates: 40, 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, 1529 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2921 NumberOfCodeBlocks, 2921 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2905 ConstructedInterpolants, 0 QuantifiedInterpolants, 11853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1281 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 1835/2068 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (2 <= a10)) && (14 == a4)) && (a12 == 0)) || ((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) || ((((a10 == 0) && (a19 <= 6)) && (14 == a4)) && (a12 == 0))) || ((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (23 <= a1))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:25:56,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE