./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/Problem01_label01.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/Problem01_label01.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 f974ef5ae084ca735facbee0c59fc65e3f1da96ae509150f8b1cec197fdee20c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:42:50,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:42:50,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:42:50,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:42:50,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:42:50,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:42:50,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:42:50,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:42:50,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:42:50,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:42:50,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:42:50,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:42:50,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:42:50,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:42:50,333 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:42:50,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:42:50,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:42:50,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:42:50,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:42:50,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:42:50,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:42:50,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:42:50,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:42:50,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:42:50,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:42:50,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:42:50,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:42:50,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:42:50,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:42:50,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:42:50,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:42:50,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:42:50,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:42:50,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:42:50,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:42:50,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:42:50,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:42:50,340 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 -> f974ef5ae084ca735facbee0c59fc65e3f1da96ae509150f8b1cec197fdee20c [2024-10-13 22:42:50,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:42:50,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:42:50,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:42:50,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:42:50,591 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:42:50,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2024-10-13 22:42:51,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:42:52,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:42:52,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2024-10-13 22:42:52,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1801f8e42/aa9368372bbb4edbbc3985782a800f10/FLAGc2e4d4b9c [2024-10-13 22:42:52,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1801f8e42/aa9368372bbb4edbbc3985782a800f10 [2024-10-13 22:42:52,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:42:52,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:42:52,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:42:52,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:42:52,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:42:52,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770bbf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52, skipping insertion in model container [2024-10-13 22:42:52,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:42:52,707 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/Problem01_label01.c[16869,16882] [2024-10-13 22:42:52,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:42:52,765 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:42:52,828 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/Problem01_label01.c[16869,16882] [2024-10-13 22:42:52,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:42:52,858 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:42:52,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52 WrapperNode [2024-10-13 22:42:52,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:42:52,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:42:52,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:42:52,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:42:52,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,920 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-13 22:42:52,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:42:52,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:42:52,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:42:52,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:42:52,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,958 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 22:42:52,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:42:52,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:42:52,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:42:52,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:42:52,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (1/1) ... [2024-10-13 22:42:52,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:42:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:42:53,023 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 22:42:53,026 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 22:42:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:42:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:42:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:42:53,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:42:53,117 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:42:53,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:42:53,843 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-13 22:42:53,844 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:42:53,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:42:53,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:42:53,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:42:53 BoogieIcfgContainer [2024-10-13 22:42:53,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:42:53,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:42:53,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:42:53,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:42:53,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:42:52" (1/3) ... [2024-10-13 22:42:53,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564ea296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:42:53, skipping insertion in model container [2024-10-13 22:42:53,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:42:52" (2/3) ... [2024-10-13 22:42:53,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564ea296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:42:53, skipping insertion in model container [2024-10-13 22:42:53,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:42:53" (3/3) ... [2024-10-13 22:42:53,900 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label01.c [2024-10-13 22:42:53,915 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:42:53,916 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:42:53,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:42:53,982 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;@50f6e110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:42:53,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:42:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 22:42:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 22:42:53,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:53,998 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, 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 22:42:53,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:54,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash 869964640, now seen corresponding path program 1 times [2024-10-13 22:42:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007726777] [2024-10-13 22:42:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:54,333 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 22:42:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007726777] [2024-10-13 22:42:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007726777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:42:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267778093] [2024-10-13 22:42:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:42:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:42:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:42:54,361 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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 22:42:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:54,390 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-13 22:42:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:42:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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 90 [2024-10-13 22:42:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:54,399 INFO L225 Difference]: With dead ends: 271 [2024-10-13 22:42:54,399 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 22:42:54,401 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 22:42:54,405 INFO L432 NwaCegarLoop]: 200 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, 200 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 22:42:54,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:42:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 22:42:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 22:42:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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 22:42:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-13 22:42:54,435 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 90 [2024-10-13 22:42:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:54,436 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-13 22:42:54,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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 22:42:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-13 22:42:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 22:42:54,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:54,438 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, 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 22:42:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:42:54,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1719475838, now seen corresponding path program 1 times [2024-10-13 22:42:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034337874] [2024-10-13 22:42:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:54,622 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 22:42:54,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034337874] [2024-10-13 22:42:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034337874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:54,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:54,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:42:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061183601] [2024-10-13 22:42:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:54,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:54,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:54,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:42:54,627 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 22:42:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:55,103 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-13 22:42:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:55,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 90 [2024-10-13 22:42:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:55,106 INFO L225 Difference]: With dead ends: 398 [2024-10-13 22:42:55,106 INFO L226 Difference]: Without dead ends: 265 [2024-10-13 22:42:55,107 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 22:42:55,107 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:55,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:42:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-13 22:42:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-13 22:42:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.481060606060606) internal successors, (391), 264 states have internal predecessors, (391), 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 22:42:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2024-10-13 22:42:55,123 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 90 [2024-10-13 22:42:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:55,124 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2024-10-13 22:42:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 22:42:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2024-10-13 22:42:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 22:42:55,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:55,126 INFO L215 NwaCegarLoop]: trace histogram [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, 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 22:42:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:42:55,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:55,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1436009830, now seen corresponding path program 1 times [2024-10-13 22:42:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991305647] [2024-10-13 22:42:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:42:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991305647] [2024-10-13 22:42:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991305647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:42:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103595499] [2024-10-13 22:42:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:55,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:55,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:42:55,216 INFO L87 Difference]: Start difference. First operand 265 states and 391 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 22:42:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:55,577 INFO L93 Difference]: Finished difference Result 791 states and 1170 transitions. [2024-10-13 22:42:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:55,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2024-10-13 22:42:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:55,579 INFO L225 Difference]: With dead ends: 791 [2024-10-13 22:42:55,580 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 22:42:55,580 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 22:42:55,581 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:55,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 27 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:42:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 22:42:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-13 22:42:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.414448669201521) internal successors, (744), 526 states have internal predecessors, (744), 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 22:42:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 744 transitions. [2024-10-13 22:42:55,600 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 744 transitions. Word has length 95 [2024-10-13 22:42:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 744 transitions. [2024-10-13 22:42:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 22:42:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 744 transitions. [2024-10-13 22:42:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 22:42:55,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:55,605 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:42:55,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:42:55,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -739958945, now seen corresponding path program 1 times [2024-10-13 22:42:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37689735] [2024-10-13 22:42:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:42:55,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37689735] [2024-10-13 22:42:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37689735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:42:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818846789] [2024-10-13 22:42:55,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:42:55,763 INFO L87 Difference]: Start difference. First operand 527 states and 744 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 22:42:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:56,104 INFO L93 Difference]: Finished difference Result 1446 states and 2031 transitions. [2024-10-13 22:42:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:56,106 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 22:42:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:56,109 INFO L225 Difference]: With dead ends: 1446 [2024-10-13 22:42:56,109 INFO L226 Difference]: Without dead ends: 920 [2024-10-13 22:42:56,111 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 22:42:56,112 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:56,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 53 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:42:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-13 22:42:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-13 22:42:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.2905331882480957) internal successors, (1186), 919 states have internal predecessors, (1186), 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 22:42:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1186 transitions. [2024-10-13 22:42:56,133 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1186 transitions. Word has length 105 [2024-10-13 22:42:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:56,133 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1186 transitions. [2024-10-13 22:42:56,133 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 22:42:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1186 transitions. [2024-10-13 22:42:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 22:42:56,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:56,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:42:56,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:42:56,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1809584209, now seen corresponding path program 1 times [2024-10-13 22:42:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528207874] [2024-10-13 22:42:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 22:42:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528207874] [2024-10-13 22:42:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528207874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:56,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:42:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762589451] [2024-10-13 22:42:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:56,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:56,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:42:56,263 INFO L87 Difference]: Start difference. First operand 920 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 22:42:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:56,592 INFO L93 Difference]: Finished difference Result 2101 states and 2724 transitions. [2024-10-13 22:42:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 106 [2024-10-13 22:42:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:56,596 INFO L225 Difference]: With dead ends: 2101 [2024-10-13 22:42:56,596 INFO L226 Difference]: Without dead ends: 1182 [2024-10-13 22:42:56,597 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 22:42:56,598 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:56,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 58 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:42:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-13 22:42:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2024-10-13 22:42:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.2523285351397122) internal successors, (1479), 1181 states have internal predecessors, (1479), 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 22:42:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1479 transitions. [2024-10-13 22:42:56,617 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1479 transitions. Word has length 106 [2024-10-13 22:42:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:56,618 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1479 transitions. [2024-10-13 22:42:56,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 22:42:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1479 transitions. [2024-10-13 22:42:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 22:42:56,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:56,620 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:42:56,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:42:56,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:56,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1778548841, now seen corresponding path program 1 times [2024-10-13 22:42:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992436743] [2024-10-13 22:42:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:42:56,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:56,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992436743] [2024-10-13 22:42:56,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992436743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:56,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:56,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:42:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137998988] [2024-10-13 22:42:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:56,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:42:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:42:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:42:56,787 INFO L87 Difference]: Start difference. First operand 1182 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 22:42:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:57,295 INFO L93 Difference]: Finished difference Result 2887 states and 3589 transitions. [2024-10-13 22:42:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:42:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2024-10-13 22:42:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:57,302 INFO L225 Difference]: With dead ends: 2887 [2024-10-13 22:42:57,302 INFO L226 Difference]: Without dead ends: 1706 [2024-10-13 22:42:57,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:42:57,305 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 259 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:57,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 56 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:42:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-13 22:42:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1575. [2024-10-13 22:42:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.2312579415501905) internal successors, (1938), 1574 states have internal predecessors, (1938), 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 22:42:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1938 transitions. [2024-10-13 22:42:57,334 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1938 transitions. Word has length 109 [2024-10-13 22:42:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:57,335 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1938 transitions. [2024-10-13 22:42:57,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 22:42:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1938 transitions. [2024-10-13 22:42:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 22:42:57,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:57,338 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, 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] [2024-10-13 22:42:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:42:57,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:57,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2006684746, now seen corresponding path program 1 times [2024-10-13 22:42:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862512013] [2024-10-13 22:42:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:42:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862512013] [2024-10-13 22:42:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862512013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:42:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:42:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498085521] [2024-10-13 22:42:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:42:57,429 INFO L87 Difference]: Start difference. First operand 1575 states and 1938 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 22:42:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:57,729 INFO L93 Difference]: Finished difference Result 1839 states and 2249 transitions. [2024-10-13 22:42:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-10-13 22:42:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:57,734 INFO L225 Difference]: With dead ends: 1839 [2024-10-13 22:42:57,734 INFO L226 Difference]: Without dead ends: 1837 [2024-10-13 22:42:57,735 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 22:42:57,735 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:57,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:42:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-10-13 22:42:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1444. [2024-10-13 22:42:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.246015246015246) internal successors, (1798), 1443 states have internal predecessors, (1798), 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 22:42:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1798 transitions. [2024-10-13 22:42:57,761 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1798 transitions. Word has length 127 [2024-10-13 22:42:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:57,762 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1798 transitions. [2024-10-13 22:42:57,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 22:42:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1798 transitions. [2024-10-13 22:42:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 22:42:57,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:42:57,765 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 22:42:57,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:42:57,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:42:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:42:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1827052434, now seen corresponding path program 1 times [2024-10-13 22:42:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:42:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013012821] [2024-10-13 22:42:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:42:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-13 22:42:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:42:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013012821] [2024-10-13 22:42:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013012821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:42:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600771843] [2024-10-13 22:42:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:42:58,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:42:58,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:42:58,061 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 22:42:58,066 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 22:42:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:42:58,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:42:58,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:42:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-13 22:42:58,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:42:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600771843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:42:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:42:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:42:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501860909] [2024-10-13 22:42:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:42:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:42:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:42:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:42:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:42:58,349 INFO L87 Difference]: Start difference. First operand 1444 states and 1798 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 22:42:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:42:58,657 INFO L93 Difference]: Finished difference Result 2885 states and 3594 transitions. [2024-10-13 22:42:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:42:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 182 [2024-10-13 22:42:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:42:58,658 INFO L225 Difference]: With dead ends: 2885 [2024-10-13 22:42:58,658 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:42:58,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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 22:42:58,660 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:42:58,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:42:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:42:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:42:58,664 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 22:42:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:42:58,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2024-10-13 22:42:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:42:58,664 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:42:58,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 22:42:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:42:58,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:42:58,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:42:58,683 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 22:42:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:42:58,873 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:42:58,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:42:58,936 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:42:58,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:42:58 BoogieIcfgContainer [2024-10-13 22:42:58,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:42:58,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:42:58,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:42:58,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:42:58,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:42:53" (3/4) ... [2024-10-13 22:42:58,949 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:42:58,961 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 22:42:58,963 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 22:42:58,965 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:42:58,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:42:59,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:42:59,067 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:42:59,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:42:59,067 INFO L158 Benchmark]: Toolchain (without parser) took 6655.04ms. Allocated memory was 134.2MB in the beginning and 285.2MB in the end (delta: 151.0MB). Free memory was 79.0MB in the beginning and 175.2MB in the end (delta: -96.2MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,067 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:42:59,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.62ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 78.6MB in the beginning and 145.1MB in the end (delta: -66.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.77ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 139.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,068 INFO L158 Benchmark]: Boogie Preprocessor took 67.25ms. Allocated memory is still 190.8MB. Free memory was 139.9MB in the beginning and 133.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,068 INFO L158 Benchmark]: RCFGBuilder took 900.87ms. Allocated memory is still 190.8MB. Free memory was 133.6MB in the beginning and 109.0MB in the end (delta: 24.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,070 INFO L158 Benchmark]: TraceAbstraction took 5052.72ms. Allocated memory was 190.8MB in the beginning and 285.2MB in the end (delta: 94.4MB). Free memory was 109.0MB in the beginning and 187.8MB in the end (delta: -78.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,070 INFO L158 Benchmark]: Witness Printer took 119.90ms. Allocated memory is still 285.2MB. Free memory was 187.8MB in the beginning and 175.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:42:59,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.62ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 78.6MB in the beginning and 145.1MB in the end (delta: -66.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.77ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 139.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.25ms. Allocated memory is still 190.8MB. Free memory was 139.9MB in the beginning and 133.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 900.87ms. Allocated memory is still 190.8MB. Free memory was 133.6MB in the beginning and 109.0MB in the end (delta: 24.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5052.72ms. Allocated memory was 190.8MB in the beginning and 285.2MB in the end (delta: 94.4MB). Free memory was 109.0MB in the beginning and 187.8MB in the end (delta: -78.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 119.90ms. Allocated memory is still 285.2MB. Free memory was 187.8MB in the beginning and 175.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 459]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2497 IncrementalHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 593 mSDtfsCounter, 2497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1575occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 524 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1086 NumberOfCodeBlocks, 1086 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1077 ConstructedInterpolants, 0 QuantifiedInterpolants, 2327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 452/462 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: 593]: Loop Invariant Derived loop invariant: (((a21 < 1) || ((a21 == 1) && (a16 <= 5))) || ((a7 != 1) && (a21 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:42:59,094 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