./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 14:25:09,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 14:25:09,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 14:25:09,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 14:25:09,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 14:25:09,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 14:25:09,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 14:25:09,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 14:25:09,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 14:25:09,343 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 14:25:09,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 14:25:09,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 14:25:09,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 14:25:09,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 14:25:09,345 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 14:25:09,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 14:25:09,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 14:25:09,346 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 14:25:09,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 14:25:09,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 14:25:09,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 14:25:09,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 14:25:09,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 14:25:09,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 14:25:09,348 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 14:25:09,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 14:25:09,349 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 14:25:09,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 14:25:09,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 14:25:09,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 14:25:09,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 14:25:09,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:25:09,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 14:25:09,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 14:25:09,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 14:25:09,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 14:25:09,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 14:25:09,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 14:25:09,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 14:25:09,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 14:25:09,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 14:25:09,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 14:25:09,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de [2023-11-23 14:25:09,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 14:25:09,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 14:25:09,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 14:25:09,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 14:25:09,584 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 14:25:09,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-11-23 14:25:10,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 14:25:10,713 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 14:25:10,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-11-23 14:25:10,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/331a6712d/d0b57da02c3745168b0366c1b5dc942b/FLAG1dcfb0953 [2023-11-23 14:25:10,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/331a6712d/d0b57da02c3745168b0366c1b5dc942b [2023-11-23 14:25:10,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 14:25:10,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 14:25:10,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 14:25:10,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 14:25:10,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 14:25:10,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c31da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10, skipping insertion in model container [2023-11-23 14:25:10,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 14:25:10,848 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-11-23 14:25:10,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:25:10,865 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 14:25:10,873 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-11-23 14:25:10,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:25:10,887 INFO L206 MainTranslator]: Completed translation [2023-11-23 14:25:10,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10 WrapperNode [2023-11-23 14:25:10,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 14:25:10,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 14:25:10,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 14:25:10,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 14:25:10,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,911 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-11-23 14:25:10,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 14:25:10,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 14:25:10,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 14:25:10,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 14:25:10,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,929 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 4, 5]. 31 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-23 14:25:10,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 14:25:10,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 14:25:10,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 14:25:10,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 14:25:10,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (1/1) ... [2023-11-23 14:25:10,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:25:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:25:10,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 14:25:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 14:25:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 14:25:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 14:25:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 14:25:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 14:25:11,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2023-11-23 14:25:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2023-11-23 14:25:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 14:25:11,080 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 14:25:11,082 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 14:25:11,192 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 14:25:11,209 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 14:25:11,209 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 14:25:11,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:11 BoogieIcfgContainer [2023-11-23 14:25:11,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 14:25:11,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 14:25:11,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 14:25:11,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 14:25:11,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:25:10" (1/3) ... [2023-11-23 14:25:11,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b4f411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:11, skipping insertion in model container [2023-11-23 14:25:11,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:10" (2/3) ... [2023-11-23 14:25:11,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b4f411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:11, skipping insertion in model container [2023-11-23 14:25:11,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:11" (3/3) ... [2023-11-23 14:25:11,216 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2023-11-23 14:25:11,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 14:25:11,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 14:25:11,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 14:25:11,262 INFO L357 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, mHoare=true, 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;@3daa2400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 14:25:11,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 14:25:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:25:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 14:25:11,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:25:11,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:25:11,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:25:11,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:25:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1319783804, now seen corresponding path program 1 times [2023-11-23 14:25:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:25:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912274914] [2023-11-23 14:25:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:25:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:25:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912274914] [2023-11-23 14:25:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912274914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:25:11,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:25:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 14:25:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010175143] [2023-11-23 14:25:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:25:11,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:25:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:25:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:25:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:25:12,001 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:25:12,079 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-23 14:25:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:25:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 14:25:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:25:12,085 INFO L225 Difference]: With dead ends: 34 [2023-11-23 14:25:12,085 INFO L226 Difference]: Without dead ends: 14 [2023-11-23 14:25:12,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 14:25:12,091 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:25:12,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:25:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-23 14:25:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-23 14:25:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-23 14:25:12,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2023-11-23 14:25:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:25:12,118 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-23 14:25:12,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-23 14:25:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 14:25:12,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:25:12,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:25:12,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 14:25:12,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:25:12,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:25:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1319843386, now seen corresponding path program 1 times [2023-11-23 14:25:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:25:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336815821] [2023-11-23 14:25:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:25:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:25:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336815821] [2023-11-23 14:25:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336815821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:25:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:25:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 14:25:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11121991] [2023-11-23 14:25:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:25:12,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 14:25:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:25:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 14:25:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:25:12,478 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:25:12,571 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-11-23 14:25:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 14:25:12,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 14:25:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:25:12,573 INFO L225 Difference]: With dead ends: 20 [2023-11-23 14:25:12,574 INFO L226 Difference]: Without dead ends: 18 [2023-11-23 14:25:12,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:25:12,576 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:25:12,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:25:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-23 14:25:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-23 14:25:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-23 14:25:12,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2023-11-23 14:25:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:25:12,584 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-23 14:25:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-11-23 14:25:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 14:25:12,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:25:12,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:25:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 14:25:12,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:25:12,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:25:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 347924421, now seen corresponding path program 1 times [2023-11-23 14:25:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:25:12,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285598760] [2023-11-23 14:25:12,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:25:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:13,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:25:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285598760] [2023-11-23 14:25:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285598760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:25:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107125118] [2023-11-23 14:25:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:25:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:25:13,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:25:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 14:25:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:13,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-23 14:25:13,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:25:13,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:13,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:13,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2023-11-23 14:25:13,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2023-11-23 14:25:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:13,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:25:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 14:25:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107125118] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:25:13,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:25:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 10 [2023-11-23 14:25:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838831243] [2023-11-23 14:25:13,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:25:13,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 14:25:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:25:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 14:25:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:25:13,598 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:25:13,719 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-11-23 14:25:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 14:25:13,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 14:25:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:25:13,719 INFO L225 Difference]: With dead ends: 29 [2023-11-23 14:25:13,719 INFO L226 Difference]: Without dead ends: 20 [2023-11-23 14:25:13,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-23 14:25:13,720 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:25:13,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:25:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-23 14:25:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2023-11-23 14:25:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-11-23 14:25:13,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2023-11-23 14:25:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:25:13,724 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-11-23 14:25:13,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-11-23 14:25:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 14:25:13,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:25:13,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:25:13,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 14:25:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:25:13,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:25:13,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:25:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 347864839, now seen corresponding path program 1 times [2023-11-23 14:25:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:25:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437641702] [2023-11-23 14:25:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:25:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:25:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437641702] [2023-11-23 14:25:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437641702] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:25:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525217626] [2023-11-23 14:25:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:25:14,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:25:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:25:14,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:25:14,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 14:25:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:25:14,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-23 14:25:14,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:25:14,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:14,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:14,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:14,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 14:25:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:25:14,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:25:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 14:25:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525217626] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:25:14,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 14:25:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 17 [2023-11-23 14:25:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074501255] [2023-11-23 14:25:14,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 14:25:14,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 14:25:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:25:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 14:25:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-11-23 14:25:14,852 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 18 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:25:15,100 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-11-23 14:25:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 14:25:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 14:25:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:25:15,100 INFO L225 Difference]: With dead ends: 25 [2023-11-23 14:25:15,100 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 14:25:15,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2023-11-23 14:25:15,101 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:25:15,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:25:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 14:25:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 14:25:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 14:25:15,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-11-23 14:25:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:25:15,103 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 14:25:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:25:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 14:25:15,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 14:25:15,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 14:25:15,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 14:25:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-23 14:25:15,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 14:25:15,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 14:25:15,588 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#k~0#1.offset| 0) (= |ULTIMATE.start_main_~#j~0#1.offset| 0) (= (select (select |#memory_int#3| |ULTIMATE.start_main_~#k~0#1.base|) 0) 0) (= (select (select |#memory_int#2| |ULTIMATE.start_main_~#j~0#1.base|) 0) 0) (= (select (select |#memory_int#1| |ULTIMATE.start_main_~#i~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0)) [2023-11-23 14:25:15,588 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-23 14:25:15,588 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 14:25:15,588 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_24_0EXIT(lines 37 52) no Hoare annotation was computed. [2023-11-23 14:25:15,589 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 37 52) the Hoare annotation is: (let ((.cse9 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse7 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse4 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~i#1.base|)) (.cse3 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse5 (select .cse9 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse15 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse8 (not (= (mod (+ (* 3 .cse5) 3) 4294967296) (mod (+ 3 (select .cse15 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296)))) (.cse14 (select .cse3 0)) (.cse0 (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse13 (select .cse4 0)) (.cse10 (not (= |func_to_recursive_line_20_to_24_0_#in~i#1.offset| 0))) (.cse11 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse12 (select .cse7 0))) (and (or (let ((.cse1 (select .cse4 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (= (mod (+ 3 (select .cse0 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296) (mod (+ 3 (* 3 .cse1)) 4294967296)) (let ((.cse2 (select .cse3 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|))) (<= .cse2 (+ (* 2 .cse1) (* (div (+ (* (- 2) .cse1) .cse2) 4294967296) 4294967296)))))) (let ((.cse6 (select .cse7 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|))) (< (+ (* (div (+ (* (- 2) .cse5) .cse6) 4294967296) 4294967296) (* 2 .cse5)) .cse6)) .cse8) (or (not (= (select .cse9 0) 1)) .cse10 .cse8 .cse11 (not (= 2 .cse12)) (and (= .cse13 1) (= .cse14 2))) (or (and (= .cse14 0) (= (select .cse0 0) 0) (= .cse13 0)) (not (= .cse5 0)) .cse10 (not (= |func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0)) .cse11 (not (= (select .cse15 0) 0)) (not (= .cse12 0))))))) [2023-11-23 14:25:15,589 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2023-11-23 14:25:15,589 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 28) no Hoare annotation was computed. [2023-11-23 14:25:15,589 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 33) no Hoare annotation was computed. [2023-11-23 14:25:15,589 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 20 35) no Hoare annotation was computed. [2023-11-23 14:25:15,590 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse9 (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse0 (select .cse9 |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse7 (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (.cse16 (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (.cse13 (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_~j#1.base|)) (.cse14 (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_~i#1.base|))) (let ((.cse1 (not (= |func_to_recursive_line_20_to_24_0_#in~i#1.offset| 0))) (.cse2 (= |func_to_recursive_line_20_to_24_0_~i#1.offset| 0)) (.cse4 (= |func_to_recursive_line_20_to_24_0_~j#1.offset| 0)) (.cse5 (select .cse14 0)) (.cse3 (select .cse13 0)) (.cse6 (not (= |func_to_recursive_line_20_to_24_0_#in~j#1.offset| 0))) (.cse8 (select .cse16 0)) (.cse10 (not (= (mod (+ (* 3 .cse0) 3) 4294967296) (mod (+ 3 (select .cse7 |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) 4294967296))))) (and (or (not (= .cse0 0)) .cse1 (not (= |func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0)) (and .cse2 (= 2 .cse3) .cse4 (= .cse5 1)) .cse6 (not (= (select .cse7 0) 0)) (not (= .cse8 0))) (or (not (= (select .cse9 0) 1)) .cse1 (and .cse2 .cse4 (= 2 .cse5) (= .cse3 4)) .cse10 .cse6 (not (= 2 .cse8))) (or (let ((.cse11 (select .cse14 |func_to_recursive_line_20_to_24_0_~i#1.offset|))) (and (= (mod (+ 3 (* .cse11 3)) 4294967296) (mod (+ 3 (select (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_~k#1.base|) |func_to_recursive_line_20_to_24_0_~k#1.offset|)) 4294967296)) (let ((.cse12 (select .cse13 |func_to_recursive_line_20_to_24_0_~j#1.offset|))) (<= .cse12 (+ (* .cse11 2) (* (div (+ .cse12 (* .cse11 (- 2))) 4294967296) 4294967296)))))) (let ((.cse15 (select .cse16 |func_to_recursive_line_20_to_24_0_#in~j#1.offset|))) (< (+ (* (div (+ (* (- 2) .cse0) .cse15) 4294967296) 4294967296) (* 2 .cse0)) .cse15)) .cse10))))) [2023-11-23 14:25:15,590 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-11-23 14:25:15,590 INFO L899 garLoopResultBuilder]: For program point L45-2(line 45) no Hoare annotation was computed. [2023-11-23 14:25:15,590 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 51) no Hoare annotation was computed. [2023-11-23 14:25:15,590 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 37 52) no Hoare annotation was computed. [2023-11-23 14:25:15,592 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-23 14:25:15,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 14:25:15,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:25:15 BoogieIcfgContainer [2023-11-23 14:25:15,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 14:25:15,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 14:25:15,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 14:25:15,597 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 14:25:15,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:11" (3/4) ... [2023-11-23 14:25:15,599 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 14:25:15,602 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_24_0 [2023-11-23 14:25:15,604 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-23 14:25:15,604 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 14:25:15,605 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 14:25:15,605 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 14:25:15,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 14:25:15,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 14:25:15,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 14:25:15,664 INFO L158 Benchmark]: Toolchain (without parser) took 4932.69ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 121.6MB in the beginning and 123.4MB in the end (delta: -1.8MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,664 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 14:25:15,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.01ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 111.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.89ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 109.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,665 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 176.2MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,665 INFO L158 Benchmark]: RCFGBuilder took 272.67ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 93.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,665 INFO L158 Benchmark]: TraceAbstraction took 4385.52ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 92.7MB in the beginning and 127.6MB in the end (delta: -34.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,665 INFO L158 Benchmark]: Witness Printer took 66.44ms. Allocated memory is still 239.1MB. Free memory was 127.6MB in the beginning and 123.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 14:25:15,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.01ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 111.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.89ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 109.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 176.2MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.67ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 93.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4385.52ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 92.7MB in the beginning and 127.6MB in the end (delta: -34.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 66.44ms. Allocated memory is still 239.1MB. Free memory was 127.6MB in the beginning and 123.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 29 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=2, InterpolantAutomatonStates: 46, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 13 PreInvPairs, 17 NumberOfFragments, 494 HoareAnnotationTreeSize, 13 FomulaSimplifications, 181 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 1933 SizeOfPredicates, 44 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 12/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 14:25:15,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE