./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.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/psyco/psyco_io_1.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 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:12:27,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:12:27,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:12:27,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:12:27,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:12:27,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:12:27,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:12:27,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:12:27,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:12:27,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:12:27,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:12:27,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:12:27,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:12:27,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:12:27,696 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:12:27,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:12:27,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:12:27,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:12:27,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:12:27,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:12:27,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:12:27,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:12:27,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:12:27,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:12:27,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:12:27,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:12:27,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:12:27,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:12:27,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:12:27,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:12:27,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:12:27,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:12:27,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:12:27,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:12:27,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:12:27,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:12:27,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:12:27,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:12:27,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:12:27,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:12:27,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:12:27,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:12:27,710 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 -> 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 [2024-10-14 00:12:27,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:12:27,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:12:27,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:12:27,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:12:27,975 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:12:27,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2024-10-14 00:12:29,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:12:29,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:12:29,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2024-10-14 00:12:29,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0d8a215/6e2a23cb4bfd4294b95dbbb55d3e03c6/FLAG2abf68a14 [2024-10-14 00:12:29,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0d8a215/6e2a23cb4bfd4294b95dbbb55d3e03c6 [2024-10-14 00:12:29,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:12:29,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:12:29,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:12:29,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:12:29,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:12:29,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:29" (1/1) ... [2024-10-14 00:12:29,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8dca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:29, skipping insertion in model container [2024-10-14 00:12:29,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:29" (1/1) ... [2024-10-14 00:12:29,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:12:29,947 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/psyco/psyco_io_1.c[11478,11491] [2024-10-14 00:12:29,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:12:29,967 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:12:29,999 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/psyco/psyco_io_1.c[11478,11491] [2024-10-14 00:12:30,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:12:30,016 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:12:30,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30 WrapperNode [2024-10-14 00:12:30,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:12:30,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:12:30,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:12:30,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:12:30,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,056 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2024-10-14 00:12:30,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:12:30,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:12:30,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:12:30,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:12:30,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,082 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-14 00:12:30,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:12:30,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:12:30,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:12:30,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:12:30,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (1/1) ... [2024-10-14 00:12:30,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:12:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:12:30,162 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-14 00:12:30,165 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-14 00:12:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:12:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:12:30,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:12:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:12:30,263 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:12:30,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:12:30,589 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-14 00:12:30,589 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:12:30,616 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:12:30,620 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 00:12:30,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:30 BoogieIcfgContainer [2024-10-14 00:12:30,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:12:30,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:12:30,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:12:30,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:12:30,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:12:29" (1/3) ... [2024-10-14 00:12:30,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bd7154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:30, skipping insertion in model container [2024-10-14 00:12:30,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:30" (2/3) ... [2024-10-14 00:12:30,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bd7154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:30, skipping insertion in model container [2024-10-14 00:12:30,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:30" (3/3) ... [2024-10-14 00:12:30,630 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2024-10-14 00:12:30,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:12:30,647 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:12:30,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:12:30,710 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;@66dd31d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:12:30,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:12:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.953125) internal successors, (125), 65 states have internal predecessors, (125), 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-14 00:12:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 00:12:30,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:30,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:30,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:30,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1580809744, now seen corresponding path program 1 times [2024-10-14 00:12:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575815915] [2024-10-14 00:12:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:30,922 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-14 00:12:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575815915] [2024-10-14 00:12:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575815915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078827737] [2024-10-14 00:12:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:30,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:12:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:12:30,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:12:30,991 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.953125) internal successors, (125), 65 states have internal predecessors, (125), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-14 00:12:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,029 INFO L93 Difference]: Finished difference Result 127 states and 241 transitions. [2024-10-14 00:12:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:12:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-14 00:12:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,043 INFO L225 Difference]: With dead ends: 127 [2024-10-14 00:12:31,044 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 00:12:31,047 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-14 00:12:31,051 INFO L432 NwaCegarLoop]: 96 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, 96 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-14 00:12:31,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 00:12:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 00:12:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 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-14 00:12:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2024-10-14 00:12:31,089 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 8 [2024-10-14 00:12:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:31,090 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2024-10-14 00:12:31,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-14 00:12:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2024-10-14 00:12:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 00:12:31,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:31,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:12:31,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:31,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2002012032, now seen corresponding path program 1 times [2024-10-14 00:12:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:31,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041177108] [2024-10-14 00:12:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:31,164 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-14 00:12:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041177108] [2024-10-14 00:12:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041177108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:31,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:31,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080076691] [2024-10-14 00:12:31,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:31,170 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-14 00:12:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,247 INFO L93 Difference]: Finished difference Result 114 states and 175 transitions. [2024-10-14 00:12:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-14 00:12:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,254 INFO L225 Difference]: With dead ends: 114 [2024-10-14 00:12:31,255 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 00:12:31,255 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-14 00:12:31,256 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:31,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 00:12:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 00:12:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 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-14 00:12:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-14 00:12:31,282 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 9 [2024-10-14 00:12:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:31,283 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-14 00:12:31,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-14 00:12:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-14 00:12:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:12:31,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:31,284 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:12:31,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:31,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1199968781, now seen corresponding path program 1 times [2024-10-14 00:12:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7282812] [2024-10-14 00:12:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7282812] [2024-10-14 00:12:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7282812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099508337] [2024-10-14 00:12:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:31,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:31,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:31,446 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,502 INFO L93 Difference]: Finished difference Result 122 states and 184 transitions. [2024-10-14 00:12:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 00:12:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,505 INFO L225 Difference]: With dead ends: 122 [2024-10-14 00:12:31,505 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 00:12:31,506 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-14 00:12:31,507 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:31,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 00:12:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-10-14 00:12:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.5) internal successors, (93), 62 states have internal predecessors, (93), 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-14 00:12:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-10-14 00:12:31,523 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 14 [2024-10-14 00:12:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:31,524 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-10-14 00:12:31,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-10-14 00:12:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 00:12:31,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:31,525 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:12:31,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:31,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash 60815211, now seen corresponding path program 1 times [2024-10-14 00:12:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565069284] [2024-10-14 00:12:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565069284] [2024-10-14 00:12:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565069284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579804378] [2024-10-14 00:12:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:31,597 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 00:12:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,658 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2024-10-14 00:12:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-10-14 00:12:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,660 INFO L225 Difference]: With dead ends: 179 [2024-10-14 00:12:31,662 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 00:12:31,662 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-14 00:12:31,663 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:31,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 180 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:12:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 00:12:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2024-10-14 00:12:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 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-14 00:12:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-14 00:12:31,681 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 19 [2024-10-14 00:12:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-14 00:12:31,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 00:12:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-14 00:12:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 00:12:31,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:31,684 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:31,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:12:31,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:31,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 33519891, now seen corresponding path program 1 times [2024-10-14 00:12:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:31,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516857602] [2024-10-14 00:12:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:12:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:31,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516857602] [2024-10-14 00:12:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516857602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179363342] [2024-10-14 00:12:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:31,791 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-14 00:12:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,825 INFO L93 Difference]: Finished difference Result 175 states and 261 transitions. [2024-10-14 00:12:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 26 [2024-10-14 00:12:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,827 INFO L225 Difference]: With dead ends: 175 [2024-10-14 00:12:31,827 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 00:12:31,828 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-14 00:12:31,829 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:31,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 00:12:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 00:12:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 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-14 00:12:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-10-14 00:12:31,842 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 26 [2024-10-14 00:12:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:31,842 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-10-14 00:12:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-14 00:12:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-10-14 00:12:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 00:12:31,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:31,844 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 00:12:31,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:12:31,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:31,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -400822240, now seen corresponding path program 1 times [2024-10-14 00:12:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377269691] [2024-10-14 00:12:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 00:12:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377269691] [2024-10-14 00:12:31,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377269691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:31,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:31,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:12:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328131024] [2024-10-14 00:12:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:31,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:12:31,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:12:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:12:31,987 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-14 00:12:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:32,031 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-10-14 00:12:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:12:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2024-10-14 00:12:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:32,032 INFO L225 Difference]: With dead ends: 71 [2024-10-14 00:12:32,032 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:12:32,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-14 00:12:32,035 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:32,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 129 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:12:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:12:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:12:32,039 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-14 00:12:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:12:32,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2024-10-14 00:12:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:32,039 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:12:32,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-14 00:12:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:12:32,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:12:32,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:12:32,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:12:32,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 00:12:32,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:12:32,065 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:12:32,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:12:32 BoogieIcfgContainer [2024-10-14 00:12:32,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:12:32,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:12:32,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:12:32,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:12:32,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:30" (3/4) ... [2024-10-14 00:12:32,081 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:12:32,090 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 00:12:32,092 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 00:12:32,092 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:12:32,093 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:12:32,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:12:32,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:12:32,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:12:32,189 INFO L158 Benchmark]: Toolchain (without parser) took 2506.95ms. Allocated memory is still 182.5MB. Free memory was 152.7MB in the beginning and 87.8MB in the end (delta: 64.9MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,189 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:12:32,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.58ms. Allocated memory is still 182.5MB. Free memory was 152.5MB in the beginning and 143.0MB in the end (delta: 9.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.78ms. Allocated memory is still 182.5MB. Free memory was 143.0MB in the beginning and 140.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,191 INFO L158 Benchmark]: Boogie Preprocessor took 45.10ms. Allocated memory is still 182.5MB. Free memory was 140.9MB in the beginning and 138.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,191 INFO L158 Benchmark]: RCFGBuilder took 517.49ms. Allocated memory is still 182.5MB. Free memory was 138.1MB in the beginning and 117.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,191 INFO L158 Benchmark]: TraceAbstraction took 1456.16ms. Allocated memory is still 182.5MB. Free memory was 117.1MB in the beginning and 95.2MB in the end (delta: 21.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,191 INFO L158 Benchmark]: Witness Printer took 109.54ms. Allocated memory is still 182.5MB. Free memory was 95.2MB in the beginning and 87.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 00:12:32,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.58ms. Allocated memory is still 182.5MB. Free memory was 152.5MB in the beginning and 143.0MB in the end (delta: 9.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.78ms. Allocated memory is still 182.5MB. Free memory was 143.0MB in the beginning and 140.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.10ms. Allocated memory is still 182.5MB. Free memory was 140.9MB in the beginning and 138.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.49ms. Allocated memory is still 182.5MB. Free memory was 138.1MB in the beginning and 117.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1456.16ms. Allocated memory is still 182.5MB. Free memory was 117.1MB in the beginning and 95.2MB in the end (delta: 21.9MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 109.54ms. Allocated memory is still 182.5MB. Free memory was 95.2MB in the beginning and 87.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 345]: 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, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 770 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 496 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 19/19 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: 25]: Loop Invariant Derived loop invariant: ((this_sink == 0) && (q == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-14 00:12:32,219 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