./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04.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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:19:44,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:19:44,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:19:44,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:19:44,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:19:44,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:19:44,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:19:44,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:19:44,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:19:44,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:19:44,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:19:44,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:19:44,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:19:44,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:19:44,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:19:44,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:19:44,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:19:44,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:19:44,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:19:44,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:19:44,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:19:44,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:19:44,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:19:44,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:19:44,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:19:44,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:19:44,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:19:44,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:19:44,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:19:44,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:19:44,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:19:44,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:19:44,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:19:44,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:19:44,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:19:44,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:19:44,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:19:44,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:19:44,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:19:44,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:19:44,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:19:44,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:19:44,847 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2024-11-09 23:19:45,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:19:45,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:19:45,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:19:45,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:19:45,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:19:45,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2024-11-09 23:19:46,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:19:46,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:19:46,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2024-11-09 23:19:46,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c96cf31/03454ac699464534801bc647a0c1fc31/FLAG2ca54bf39 [2024-11-09 23:19:46,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c96cf31/03454ac699464534801bc647a0c1fc31 [2024-11-09 23:19:46,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:19:46,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:19:46,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:19:46,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:19:46,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:19:46,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:46" (1/1) ... [2024-11-09 23:19:46,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51349a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:46, skipping insertion in model container [2024-11-09 23:19:46,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:46" (1/1) ... [2024-11-09 23:19:46,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:19:47,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2024-11-09 23:19:47,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:19:47,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:19:47,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2024-11-09 23:19:47,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:19:47,117 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:19:47,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47 WrapperNode [2024-11-09 23:19:47,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:19:47,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:19:47,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:19:47,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:19:47,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,147 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-09 23:19:47,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:19:47,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:19:47,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:19:47,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:19:47,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,175 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:19:47,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:19:47,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:19:47,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:19:47,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:19:47,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (1/1) ... [2024-11-09 23:19:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:19:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:47,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:19:47,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:19:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-11-09 23:19:47,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-11-09 23:19:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:19:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:19:47,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:19:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:19:47,327 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:19:47,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:19:47,401 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2024-11-09 23:19:47,446 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 23:19:47,446 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:19:47,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:19:47,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:19:47,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:47 BoogieIcfgContainer [2024-11-09 23:19:47,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:19:47,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:19:47,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:19:47,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:19:47,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:19:46" (1/3) ... [2024-11-09 23:19:47,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572ab1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:19:47, skipping insertion in model container [2024-11-09 23:19:47,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:47" (2/3) ... [2024-11-09 23:19:47,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572ab1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:19:47, skipping insertion in model container [2024-11-09 23:19:47,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:47" (3/3) ... [2024-11-09 23:19:47,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2024-11-09 23:19:47,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:19:47,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:19:47,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:19:47,569 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;@5103d8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:19:47,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:19:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 23:19:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:19:47,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:47,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:47,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -830993916, now seen corresponding path program 1 times [2024-11-09 23:19:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041747182] [2024-11-09 23:19:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:19:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041747182] [2024-11-09 23:19:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041747182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:19:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:19:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:19:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900530878] [2024-11-09 23:19:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:19:47,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:19:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:19:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:19:47,978 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:48,068 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-09 23:19:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:19:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 23:19:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:48,079 INFO L225 Difference]: With dead ends: 33 [2024-11-09 23:19:48,079 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 23:19:48,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-09 23:19:48,089 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:48,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 23:19:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 23:19:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 23:19:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 23:19:48,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-09 23:19:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:48,126 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 23:19:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 23:19:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 23:19:48,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:48,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:48,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:19:48,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1134286775, now seen corresponding path program 1 times [2024-11-09 23:19:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:48,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8651353] [2024-11-09 23:19:48,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:19:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8651353] [2024-11-09 23:19:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8651353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:19:48,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:19:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:19:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068269544] [2024-11-09 23:19:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:19:48,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:19:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:19:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:19:48,239 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:48,303 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-09 23:19:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:19:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 23:19:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:48,305 INFO L225 Difference]: With dead ends: 26 [2024-11-09 23:19:48,306 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 23:19:48,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-09 23:19:48,308 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:48,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 23:19:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 23:19:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 23:19:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 23:19:48,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-11-09 23:19:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:48,322 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 23:19:48,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-09 23:19:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 23:19:48,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:48,324 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:48,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:19:48,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:48,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1490281339, now seen corresponding path program 1 times [2024-11-09 23:19:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532131834] [2024-11-09 23:19:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:19:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:19:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532131834] [2024-11-09 23:19:48,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532131834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320721582] [2024-11-09 23:19:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:48,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:48,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:19:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:48,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:19:48,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:19:48,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:19:48,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320721582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:48,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-09 23:19:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221556779] [2024-11-09 23:19:48,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:48,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:19:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:48,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:19:48,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:19:48,964 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 23:19:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:49,135 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2024-11-09 23:19:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:19:49,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2024-11-09 23:19:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:49,137 INFO L225 Difference]: With dead ends: 48 [2024-11-09 23:19:49,138 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 23:19:49,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:19:49,139 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:49,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 65 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 23:19:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 23:19:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-09 23:19:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-11-09 23:19:49,148 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 24 [2024-11-09 23:19:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:49,148 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-11-09 23:19:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 23:19:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-11-09 23:19:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:19:49,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:49,151 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:49,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:19:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:49,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:49,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 724155635, now seen corresponding path program 1 times [2024-11-09 23:19:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527050974] [2024-11-09 23:19:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:19:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 23:19:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527050974] [2024-11-09 23:19:49,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527050974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532332338] [2024-11-09 23:19:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:49,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:49,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:49,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:19:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:49,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:19:49,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 23:19:50,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 23:19:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532332338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:50,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2024-11-09 23:19:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952661992] [2024-11-09 23:19:50,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:50,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:19:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:50,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:19:50,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:19:50,430 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 23:19:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:50,650 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2024-11-09 23:19:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:19:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 66 [2024-11-09 23:19:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:50,656 INFO L225 Difference]: With dead ends: 75 [2024-11-09 23:19:50,658 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 23:19:50,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:19:50,660 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:50,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 104 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 23:19:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-09 23:19:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2024-11-09 23:19:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-11-09 23:19:50,683 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 66 [2024-11-09 23:19:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-11-09 23:19:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 23:19:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-11-09 23:19:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 23:19:50,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:50,690 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:50,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 23:19:50,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1264640090, now seen corresponding path program 2 times [2024-11-09 23:19:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743768834] [2024-11-09 23:19:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:19:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:19:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:19:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:19:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2024-11-09 23:19:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743768834] [2024-11-09 23:19:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743768834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532806288] [2024-11-09 23:19:51,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:19:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:51,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:51,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:51,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:19:51,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:19:51,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:51,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:19:51,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2024-11-09 23:19:51,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-09 23:19:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532806288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:52,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:52,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2024-11-09 23:19:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170001794] [2024-11-09 23:19:52,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:52,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:19:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:19:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:19:52,283 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 23:19:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:52,505 INFO L93 Difference]: Finished difference Result 107 states and 166 transitions. [2024-11-09 23:19:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:19:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 145 [2024-11-09 23:19:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:52,508 INFO L225 Difference]: With dead ends: 107 [2024-11-09 23:19:52,508 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 23:19:52,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 321 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:19:52,512 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:52,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 138 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 23:19:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-09 23:19:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 11 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (27), 14 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-09 23:19:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2024-11-09 23:19:52,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 145 [2024-11-09 23:19:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:52,534 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2024-11-09 23:19:52,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 23:19:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2024-11-09 23:19:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:19:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:52,537 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 15, 8, 8, 8, 8, 8, 8, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:52,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:52,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:52,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:52,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash -704847253, now seen corresponding path program 3 times [2024-11-09 23:19:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362655805] [2024-11-09 23:19:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:19:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:19:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:19:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:19:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:19:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 72 proven. 285 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-09 23:19:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:53,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362655805] [2024-11-09 23:19:53,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362655805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:53,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646385559] [2024-11-09 23:19:53,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:19:53,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:53,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:53,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:53,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:19:53,289 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 23:19:53,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:53,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:19:53,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 254 proven. 17 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 23:19:53,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 254 proven. 18 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-09 23:19:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646385559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:53,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 9] total 21 [2024-11-09 23:19:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025329480] [2024-11-09 23:19:53,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:53,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:19:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:19:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:19:53,846 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 9 states have call successors, (19) [2024-11-09 23:19:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:54,124 INFO L93 Difference]: Finished difference Result 129 states and 218 transitions. [2024-11-09 23:19:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:19:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 9 states have call successors, (19) Word has length 122 [2024-11-09 23:19:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:54,126 INFO L225 Difference]: With dead ends: 129 [2024-11-09 23:19:54,127 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 23:19:54,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 267 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:19:54,132 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:54,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 192 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:19:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 23:19:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-09 23:19:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 37 states have internal predecessors, (43), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 23:19:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-09 23:19:54,148 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 122 [2024-11-09 23:19:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:54,148 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-09 23:19:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (19), 14 states have call predecessors, (19), 9 states have call successors, (19) [2024-11-09 23:19:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-09 23:19:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:19:54,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:54,150 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:54,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:19:54,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:54,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:54,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1946949018, now seen corresponding path program 4 times [2024-11-09 23:19:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729471574] [2024-11-09 23:19:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:19:54,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:19:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:19:54,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:19:54,413 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:19:54,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:19:54,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:19:54,418 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-11-09 23:19:54,456 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:19:54,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:19:54 BoogieIcfgContainer [2024-11-09 23:19:54,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:19:54,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:19:54,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:19:54,460 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:19:54,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:47" (3/4) ... [2024-11-09 23:19:54,461 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:19:54,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:19:54,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:19:54,514 INFO L158 Benchmark]: Toolchain (without parser) took 7676.61ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 97.4MB in the beginning and 98.3MB in the end (delta: -900.6kB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,514 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 153.1MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:19:54,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.23ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 84.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.73ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 83.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:19:54,515 INFO L158 Benchmark]: Boogie Preprocessor took 34.41ms. Allocated memory is still 153.1MB. Free memory was 83.5MB in the beginning and 82.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,515 INFO L158 Benchmark]: IcfgBuilder took 277.26ms. Allocated memory is still 153.1MB. Free memory was 82.1MB in the beginning and 71.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,516 INFO L158 Benchmark]: TraceAbstraction took 6995.37ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 70.9MB in the beginning and 101.5MB in the end (delta: -30.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,516 INFO L158 Benchmark]: Witness Printer took 54.13ms. Allocated memory is still 201.3MB. Free memory was 101.5MB in the beginning and 98.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:19:54,517 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.26ms. Allocated memory is still 153.1MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.23ms. Allocated memory is still 153.1MB. Free memory was 97.1MB in the beginning and 84.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.73ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 83.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.41ms. Allocated memory is still 153.1MB. Free memory was 83.5MB in the beginning and 82.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 277.26ms. Allocated memory is still 153.1MB. Free memory was 82.1MB in the beginning and 71.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6995.37ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 70.9MB in the beginning and 101.5MB in the end (delta: -30.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 54.13ms. Allocated memory is still 201.3MB. Free memory was 101.5MB in the beginning and 98.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) [L35] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 476 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 112 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 784 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=5, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 844 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1786 SizeOfPredicates, 8 NumberOfNonLiveVariables, 733 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 4906/6219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:19:54,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE