./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/recursive-simple/fibo_5-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:48:47,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:48:47,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:48:47,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:48:47,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:48:47,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:48:47,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:48:47,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:48:47,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:48:47,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:48:47,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:48:47,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:48:47,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:48:47,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:48:47,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:48:47,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:48:47,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:48:47,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:48:47,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 [2024-11-06 23:48:47,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:48:47,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:48:47,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:48:47,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:48:47,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:48:47,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_5-2.c [2024-11-06 23:48:48,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:48:48,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:48:48,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c [2024-11-06 23:48:48,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef7bb700b/909cfa449350417ca4c571d8fa6913dd/FLAG318f532a7 [2024-11-06 23:48:48,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef7bb700b/909cfa449350417ca4c571d8fa6913dd [2024-11-06 23:48:48,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:48:48,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:48:48,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:48:48,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:48:48,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:48:48,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:48:48" (1/1) ... [2024-11-06 23:48:48,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6448de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:48, skipping insertion in model container [2024-11-06 23:48:48,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:48:48" (1/1) ... [2024-11-06 23:48:48,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:48:49,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2024-11-06 23:48:49,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:48:49,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:48:49,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2024-11-06 23:48:49,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:48:49,031 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:48:49,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49 WrapperNode [2024-11-06 23:48:49,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:48:49,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:48:49,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:48:49,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:48:49,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,055 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-06 23:48:49,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:48:49,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:48:49,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:48:49,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:48:49,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,074 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-06 23:48:49,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:48:49,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:48:49,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:48:49,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:48:49,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (1/1) ... [2024-11-06 23:48:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:48:49,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:48:49,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:48:49,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:48:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:48:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:48:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:48:49,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:48:49,128 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-06 23:48:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-06 23:48:49,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:48:49,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:48:49,237 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-06 23:48:49,237 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:48:49,244 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:48:49,244 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 23:48:49,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:48:49 BoogieIcfgContainer [2024-11-06 23:48:49,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:48:49,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:48:49,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:48:49,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:48:49,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:48:48" (1/3) ... [2024-11-06 23:48:49,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6921822b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:48:49, skipping insertion in model container [2024-11-06 23:48:49,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:48:49" (2/3) ... [2024-11-06 23:48:49,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6921822b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:48:49, skipping insertion in model container [2024-11-06 23:48:49,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:48:49" (3/3) ... [2024-11-06 23:48:49,252 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2024-11-06 23:48:49,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:48:49,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:48:49,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:48:49,301 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;@134dcd00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:48:49,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:48:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-06 23:48:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 23:48:49,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:49,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:49,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:49,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-06 23:48:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212224369] [2024-11-06 23:48:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,486 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-06 23:48:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:49,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212224369] [2024-11-06 23:48:49,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212224369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:48:49,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:48:49,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:48:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675422160] [2024-11-06 23:48:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:48:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:48:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:48:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:48:49,508 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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.6) internal successors, (8), 4 states have internal predecessors, (8), 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-06 23:48:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:49,537 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-06 23:48:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:48:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-11-06 23:48:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:49,542 INFO L225 Difference]: With dead ends: 30 [2024-11-06 23:48:49,543 INFO L226 Difference]: Without dead ends: 18 [2024-11-06 23:48:49,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-06 23:48:49,546 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:49,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:48:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-06 23:48:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-06 23:48:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-06 23:48:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-06 23:48:49,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-06 23:48:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:49,569 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-06 23:48:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-06 23:48:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-06 23:48:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 23:48:49,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:49,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:49,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:48:49,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-06 23:48:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830833652] [2024-11-06 23:48:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,649 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-06 23:48:49,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830833652] [2024-11-06 23:48:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830833652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:48:49,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:48:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:48:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978840799] [2024-11-06 23:48:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:48:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:48:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:48:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:48:49,652 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 23:48:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:49,666 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-06 23:48:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:48:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 23:48:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:49,668 INFO L225 Difference]: With dead ends: 24 [2024-11-06 23:48:49,668 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 23:48:49,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-06 23:48:49,668 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:49,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:48:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 23:48:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-06 23:48:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-06 23:48:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-06 23:48:49,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-06 23:48:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:49,673 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-06 23:48:49,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 23:48:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-06 23:48:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 23:48:49,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:49,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:49,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:48:49,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:49,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-06 23:48:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456223172] [2024-11-06 23:48:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 23:48:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,828 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-06 23:48:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:49,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456223172] [2024-11-06 23:48:49,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456223172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:48:49,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242923670] [2024-11-06 23:48:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:49,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:48:49,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:48:49,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 23:48:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:49,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 23:48:49,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:48:49,957 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-06 23:48:49,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:48:50,107 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-06 23:48:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242923670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:48:50,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:48:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-11-06 23:48:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557240195] [2024-11-06 23:48:50,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:48:50,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 23:48:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 23:48:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:48:50,109 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 23:48:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:50,176 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-06 23:48:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:48:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2024-11-06 23:48:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:50,180 INFO L225 Difference]: With dead ends: 35 [2024-11-06 23:48:50,180 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 23:48:50,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:48:50,181 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:50,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:48:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 23:48:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-06 23:48:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 23:48:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-06 23:48:50,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-06 23:48:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:50,185 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-06 23:48:50,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 23:48:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-06 23:48:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 23:48:50,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:50,186 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-06 23:48:50,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 23:48:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:50,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-06 23:48:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802091442] [2024-11-06 23:48:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:48:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 23:48:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802091442] [2024-11-06 23:48:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802091442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:48:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158931091] [2024-11-06 23:48:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:50,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:50,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:48:50,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:48:50,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 23:48:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:50,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 23:48:50,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:48:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 23:48:50,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:48:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-06 23:48:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158931091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:48:50,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:48:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-06 23:48:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361551202] [2024-11-06 23:48:50,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:48:50,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 23:48:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 23:48:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:48:50,789 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-06 23:48:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:50,886 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2024-11-06 23:48:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:48:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2024-11-06 23:48:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:50,887 INFO L225 Difference]: With dead ends: 38 [2024-11-06 23:48:50,888 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 23:48:50,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:48:50,888 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:50,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 59 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:48:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 23:48:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 23:48:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-06 23:48:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-06 23:48:50,899 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2024-11-06 23:48:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-06 23:48:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-06 23:48:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-11-06 23:48:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 23:48:50,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:50,903 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:50,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 23:48:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:51,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-06 23:48:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663809700] [2024-11-06 23:48:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:48:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 23:48:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-06 23:48:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663809700] [2024-11-06 23:48:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663809700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:48:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139645279] [2024-11-06 23:48:51,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 23:48:51,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:48:51,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:48:51,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 23:48:51,332 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 23:48:51,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 23:48:51,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 23:48:51,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:48:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 23:48:51,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:48:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 23:48:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139645279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:48:51,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:48:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-11-06 23:48:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201288324] [2024-11-06 23:48:51,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:48:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 23:48:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 23:48:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:48:51,705 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-06 23:48:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:51,852 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2024-11-06 23:48:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:48:51,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2024-11-06 23:48:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:51,853 INFO L225 Difference]: With dead ends: 69 [2024-11-06 23:48:51,853 INFO L226 Difference]: Without dead ends: 38 [2024-11-06 23:48:51,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-11-06 23:48:51,854 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:51,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:48:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-06 23:48:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-06 23:48:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-06 23:48:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-06 23:48:51,863 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2024-11-06 23:48:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:51,864 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-06 23:48:51,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-06 23:48:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-06 23:48:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 23:48:51,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:51,867 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:51,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 23:48:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:52,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -721858190, now seen corresponding path program 3 times [2024-11-06 23:48:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117938990] [2024-11-06 23:48:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:48:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:48:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 23:48:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:48:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:48:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:48:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 23:48:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-06 23:48:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:48:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-06 23:48:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:48:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117938990] [2024-11-06 23:48:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117938990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:48:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151988726] [2024-11-06 23:48:52,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 23:48:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:48:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:48:52,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:48:52,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 23:48:52,520 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-06 23:48:52,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 23:48:52,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 23:48:52,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:48:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-06 23:48:52,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:48:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-06 23:48:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151988726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:48:52,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 23:48:52,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-11-06 23:48:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516482138] [2024-11-06 23:48:52,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 23:48:52,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-06 23:48:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:48:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-06 23:48:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-06 23:48:52,940 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-06 23:48:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:48:53,162 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2024-11-06 23:48:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-06 23:48:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 93 [2024-11-06 23:48:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:48:53,164 INFO L225 Difference]: With dead ends: 89 [2024-11-06 23:48:53,165 INFO L226 Difference]: Without dead ends: 53 [2024-11-06 23:48:53,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-06 23:48:53,166 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:48:53,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:48:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-06 23:48:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-06 23:48:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-06 23:48:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-06 23:48:53,172 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 93 [2024-11-06 23:48:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:48:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-06 23:48:53,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-06 23:48:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-06 23:48:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-06 23:48:53,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:48:53,174 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:48:53,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 23:48:53,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-06 23:48:53,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:48:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:48:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -292645265, now seen corresponding path program 4 times [2024-11-06 23:48:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:48:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340249481] [2024-11-06 23:48:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:48:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:48:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:48:53,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:48:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:48:53,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:48:53,413 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:48:53,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:48:53,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:48:53,418 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-11-06 23:48:53,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:48:53,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:48:53 BoogieIcfgContainer [2024-11-06 23:48:53,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:48:53,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:48:53,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:48:53,443 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:48:53,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:48:49" (3/4) ... [2024-11-06 23:48:53,444 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:48:53,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:48:53,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:48:53,476 INFO L158 Benchmark]: Toolchain (without parser) took 4596.21ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 92.1MB in the beginning and 85.1MB in the end (delta: 7.0MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-11-06 23:48:53,477 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:48:53,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.60ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 81.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:48:53,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.78ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:48:53,477 INFO L158 Benchmark]: Boogie Preprocessor took 21.06ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.4MB in the end (delta: 940.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:48:53,477 INFO L158 Benchmark]: RCFGBuilder took 166.46ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 70.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:48:53,478 INFO L158 Benchmark]: TraceAbstraction took 4195.95ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 69.7MB in the beginning and 88.5MB in the end (delta: -18.7MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-06 23:48:53,478 INFO L158 Benchmark]: Witness Printer took 33.16ms. Allocated memory is still 184.5MB. Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:48:53,479 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.20ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.60ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 81.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.78ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.06ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.4MB in the end (delta: 940.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 166.46ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 70.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4195.95ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 69.7MB in the beginning and 88.5MB in the end (delta: -18.7MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Witness Printer took 33.16ms. Allocated memory is still 184.5MB. Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.4MB). There was no memory consumed. 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 5; VAL [x=5] [L27] CALL, EXPR fibo(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=5] [L27] int result = fibo(x); [L28] COND TRUE result == 5 VAL [x=5] [L29] reach_error() VAL [x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 329 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 110 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 376 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 481 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 1078 SizeOfPredicates, 6 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1204/1497 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-06 23:48:53,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE