./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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-simple/recursified_deep-nested.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 dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:02:06,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:02:06,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:02:06,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:02:06,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:02:06,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:02:06,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:02:06,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:02:06,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:02:06,558 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:02:06,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:02:06,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:02:06,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:02:06,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:02:06,561 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:02:06,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:02:06,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:02:06,562 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:02:06,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:02:06,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:02:06,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:02:06,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:02:06,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:02:06,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:02:06,565 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:02:06,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:02:06,565 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:02:06,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:02:06,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:02:06,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:02:06,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:02:06,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:02:06,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:02:06,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:02:06,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:02:06,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:02:06,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:02:06,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:02:06,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:02:06,569 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:02:06,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:02:06,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:02:06,570 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:02:06,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:02:06,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:02:06,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:02:06,815 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:02:06,815 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:02:06,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c [2023-11-22 23:02:07,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:02:08,025 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:02:08,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-simple/recursified_deep-nested.c [2023-11-22 23:02:08,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec004f56/ecd5298df7354ddb85b57035da1b2c9c/FLAGd89f60bb1 [2023-11-22 23:02:08,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ec004f56/ecd5298df7354ddb85b57035da1b2c9c [2023-11-22 23:02:08,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:02:08,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:02:08,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:02:08,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:02:08,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:02:08,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6495b411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08, skipping insertion in model container [2023-11-22 23:02:08,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,090 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:02:08,233 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-simple/recursified_deep-nested.c[1440,1453] [2023-11-22 23:02:08,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:02:08,276 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:02:08,289 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-simple/recursified_deep-nested.c[1440,1453] [2023-11-22 23:02:08,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:02:08,326 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:02:08,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08 WrapperNode [2023-11-22 23:02:08,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:02:08,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:02:08,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:02:08,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:02:08,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,378 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-11-22 23:02:08,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:02:08,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:02:08,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:02:08,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:02:08,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:02:08,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:02:08,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:02:08,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:02:08,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (1/1) ... [2023-11-22 23:02:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:02:08,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:08,466 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-22 23:02:08,485 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-22 23:02:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2023-11-22 23:02:08,509 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2023-11-22 23:02:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:02:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2023-11-22 23:02:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2023-11-22 23:02:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2023-11-22 23:02:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2023-11-22 23:02:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:02:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2023-11-22 23:02:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2023-11-22 23:02:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2023-11-22 23:02:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2023-11-22 23:02:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:02:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 23:02:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:02:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:02:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 23:02:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:02:08,610 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:02:08,612 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:02:08,812 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:02:08,831 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:02:08,831 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 23:02:08,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:08 BoogieIcfgContainer [2023-11-22 23:02:08,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:02:08,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:02:08,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:02:08,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:02:08,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:08" (1/3) ... [2023-11-22 23:02:08,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3295bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:08, skipping insertion in model container [2023-11-22 23:02:08,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:08" (2/3) ... [2023-11-22 23:02:08,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3295bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:08, skipping insertion in model container [2023-11-22 23:02:08,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:08" (3/3) ... [2023-11-22 23:02:08,838 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2023-11-22 23:02:08,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:02:08,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:02:08,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:02:08,960 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;@464408ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:02:08,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:02:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 23:02:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 23:02:08,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:08,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:08,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:08,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2021789981, now seen corresponding path program 1 times [2023-11-22 23:02:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888098899] [2023-11-22 23:02:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:09,361 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-22 23:02:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:09,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888098899] [2023-11-22 23:02:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888098899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:02:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:02:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:02:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699475866] [2023-11-22 23:02:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:02:09,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:02:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:09,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:02:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:02:09,388 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:09,468 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2023-11-22 23:02:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:02:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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 25 [2023-11-22 23:02:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:09,479 INFO L225 Difference]: With dead ends: 106 [2023-11-22 23:02:09,479 INFO L226 Difference]: Without dead ends: 56 [2023-11-22 23:02:09,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:02:09,489 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:09,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:02:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-22 23:02:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-11-22 23:02:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:02:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2023-11-22 23:02:09,532 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 25 [2023-11-22 23:02:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:09,533 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2023-11-22 23:02:09,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2023-11-22 23:02:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 23:02:09,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:09,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:09,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:02:09,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:09,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -246782619, now seen corresponding path program 1 times [2023-11-22 23:02:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803335899] [2023-11-22 23:02:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:09,731 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-22 23:02:09,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803335899] [2023-11-22 23:02:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803335899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:02:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:02:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:02:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939930959] [2023-11-22 23:02:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:02:09,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:02:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:02:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:02:09,736 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:09,782 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2023-11-22 23:02:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:02:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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 25 [2023-11-22 23:02:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:09,785 INFO L225 Difference]: With dead ends: 98 [2023-11-22 23:02:09,786 INFO L226 Difference]: Without dead ends: 54 [2023-11-22 23:02:09,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:02:09,789 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 152 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:02:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-22 23:02:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-11-22 23:02:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:02:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-11-22 23:02:09,802 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 25 [2023-11-22 23:02:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:09,802 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-11-22 23:02:09,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-11-22 23:02:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 23:02:09,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:09,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:09,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:02:09,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:09,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -244935577, now seen corresponding path program 1 times [2023-11-22 23:02:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399423276] [2023-11-22 23:02:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:09,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:09,944 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-22 23:02:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399423276] [2023-11-22 23:02:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399423276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:02:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:02:09,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:02:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855050848] [2023-11-22 23:02:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:02:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:02:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:02:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:02:09,952 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:09,990 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2023-11-22 23:02:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:02:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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 25 [2023-11-22 23:02:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:09,993 INFO L225 Difference]: With dead ends: 98 [2023-11-22 23:02:09,993 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 23:02:09,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:02:09,998 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:09,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:02:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 23:02:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-11-22 23:02:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:02:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-11-22 23:02:10,009 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 25 [2023-11-22 23:02:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:10,010 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-22 23:02:10,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 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-22 23:02:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-11-22 23:02:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 23:02:10,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:10,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:10,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 23:02:10,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:10,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1593118945, now seen corresponding path program 1 times [2023-11-22 23:02:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453773777] [2023-11-22 23:02:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:12,509 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-22 23:02:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453773777] [2023-11-22 23:02:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453773777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:02:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:02:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-22 23:02:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724042195] [2023-11-22 23:02:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:02:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 23:02:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 23:02:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2023-11-22 23:02:12,512 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 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-22 23:02:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:13,211 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2023-11-22 23:02:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-22 23:02:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 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 25 [2023-11-22 23:02:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:13,214 INFO L225 Difference]: With dead ends: 133 [2023-11-22 23:02:13,214 INFO L226 Difference]: Without dead ends: 84 [2023-11-22 23:02:13,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2023-11-22 23:02:13,216 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:13,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 528 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 23:02:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-22 23:02:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2023-11-22 23:02:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 59 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 5 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2023-11-22 23:02:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2023-11-22 23:02:13,226 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 25 [2023-11-22 23:02:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:13,226 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2023-11-22 23:02:13,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 5 states have call successors, (5), 5 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-22 23:02:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2023-11-22 23:02:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 23:02:13,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:13,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:13,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 23:02:13,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:13,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1542600501, now seen corresponding path program 1 times [2023-11-22 23:02:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022298814] [2023-11-22 23:02:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:02:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:02:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022298814] [2023-11-22 23:02:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022298814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:02:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:02:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 23:02:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997221975] [2023-11-22 23:02:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:02:14,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 23:02:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 23:02:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:02:14,451 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 23:02:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:14,767 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2023-11-22 23:02:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 23:02:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-11-22 23:02:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:14,769 INFO L225 Difference]: With dead ends: 131 [2023-11-22 23:02:14,770 INFO L226 Difference]: Without dead ends: 80 [2023-11-22 23:02:14,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-22 23:02:14,771 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:14,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 274 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 23:02:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-22 23:02:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-22 23:02:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 61 states have internal predecessors, (70), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (20), 8 states have call predecessors, (20), 12 states have call successors, (20) [2023-11-22 23:02:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-11-22 23:02:14,781 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 34 [2023-11-22 23:02:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:14,781 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-11-22 23:02:14,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 23:02:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-11-22 23:02:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 23:02:14,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:14,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:14,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 23:02:14,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:14,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1196697489, now seen corresponding path program 1 times [2023-11-22 23:02:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106397314] [2023-11-22 23:02:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:02:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106397314] [2023-11-22 23:02:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106397314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418187192] [2023-11-22 23:02:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:15,555 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-22 23:02:15,572 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-22 23:02:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:15,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-22 23:02:15,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:15,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6710 treesize of output 6646 [2023-11-22 23:02:15,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:02:15,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:15,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-22 23:02:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:02:15,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:02:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:02:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418187192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:02:16,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:02:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 31 [2023-11-22 23:02:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176761868] [2023-11-22 23:02:16,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:02:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-22 23:02:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-22 23:02:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2023-11-22 23:02:16,357 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:02:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:17,645 INFO L93 Difference]: Finished difference Result 235 states and 313 transitions. [2023-11-22 23:02:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-22 23:02:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-22 23:02:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:17,647 INFO L225 Difference]: With dead ends: 235 [2023-11-22 23:02:17,647 INFO L226 Difference]: Without dead ends: 178 [2023-11-22 23:02:17,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=2764, Unknown=0, NotChecked=0, Total=3080 [2023-11-22 23:02:17,649 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 216 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:17,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 718 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 23:02:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-22 23:02:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2023-11-22 23:02:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 130 states have internal predecessors, (154), 18 states have call successors, (18), 15 states have call predecessors, (18), 16 states have return successors, (32), 11 states have call predecessors, (32), 16 states have call successors, (32) [2023-11-22 23:02:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2023-11-22 23:02:17,662 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 37 [2023-11-22 23:02:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:17,662 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2023-11-22 23:02:17,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 21 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:02:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2023-11-22 23:02:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-22 23:02:17,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:17,664 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:17,700 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-22 23:02:17,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 23:02:17,877 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:17,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1755939354, now seen corresponding path program 1 times [2023-11-22 23:02:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304051052] [2023-11-22 23:02:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 23:02:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:19,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:02:19,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:19,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304051052] [2023-11-22 23:02:19,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304051052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:19,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773754806] [2023-11-22 23:02:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:19,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:19,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:19,616 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-22 23:02:19,635 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-22 23:02:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:19,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-22 23:02:19,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:19,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1670 treesize of output 1654 [2023-11-22 23:02:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:02:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:20,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-22 23:02:20,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:02:20,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:02:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773754806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:20,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:02:20,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 43 [2023-11-22 23:02:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520407768] [2023-11-22 23:02:20,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:02:20,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 23:02:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 23:02:20,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2354, Unknown=35, NotChecked=0, Total=2550 [2023-11-22 23:02:20,877 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:02:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:23,382 INFO L93 Difference]: Finished difference Result 395 states and 520 transitions. [2023-11-22 23:02:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-22 23:02:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2023-11-22 23:02:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:23,385 INFO L225 Difference]: With dead ends: 395 [2023-11-22 23:02:23,385 INFO L226 Difference]: Without dead ends: 261 [2023-11-22 23:02:23,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=646, Invalid=8216, Unknown=68, NotChecked=0, Total=8930 [2023-11-22 23:02:23,387 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 222 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:23,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 992 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 23:02:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-22 23:02:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 200. [2023-11-22 23:02:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.2684563758389262) internal successors, (189), 161 states have internal predecessors, (189), 26 states have call successors, (26), 21 states have call predecessors, (26), 24 states have return successors, (52), 19 states have call predecessors, (52), 24 states have call successors, (52) [2023-11-22 23:02:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2023-11-22 23:02:23,410 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 48 [2023-11-22 23:02:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:23,410 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2023-11-22 23:02:23,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 30 states have internal predecessors, (60), 16 states have call successors, (16), 13 states have call predecessors, (16), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 23:02:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2023-11-22 23:02:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 23:02:23,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:23,412 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:23,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 23:02:23,624 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,SelfDestructingSolverStorable6 [2023-11-22 23:02:23,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:23,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1819595530, now seen corresponding path program 2 times [2023-11-22 23:02:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075280983] [2023-11-22 23:02:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 23:02:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 23:02:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 23:02:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075280983] [2023-11-22 23:02:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075280983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457892200] [2023-11-22 23:02:25,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 23:02:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:25,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:02:25,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 23:02:26,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 23:02:26,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:02:26,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 224 conjunts are in the unsatisfiable core [2023-11-22 23:02:26,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:26,079 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:02:26,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2023-11-22 23:02:26,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 23:02:26,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:26,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:26,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:26,736 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:02:26,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 23:02:26,844 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 23:02:26,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-22 23:02:26,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:27,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-22 23:02:27,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:02:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457892200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:27,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:02:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 51 [2023-11-22 23:02:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822678172] [2023-11-22 23:02:27,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:02:27,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-22 23:02:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-22 23:02:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3127, Unknown=26, NotChecked=0, Total=3306 [2023-11-22 23:02:27,845 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:02:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:32,785 INFO L93 Difference]: Finished difference Result 530 states and 707 transitions. [2023-11-22 23:02:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-22 23:02:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2023-11-22 23:02:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:32,792 INFO L225 Difference]: With dead ends: 530 [2023-11-22 23:02:32,792 INFO L226 Difference]: Without dead ends: 353 [2023-11-22 23:02:32,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=910, Invalid=14558, Unknown=32, NotChecked=0, Total=15500 [2023-11-22 23:02:32,797 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 316 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:32,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1282 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-22 23:02:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-22 23:02:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 263. [2023-11-22 23:02:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.2736842105263158) internal successors, (242), 206 states have internal predecessors, (242), 35 states have call successors, (35), 29 states have call predecessors, (35), 37 states have return successors, (80), 29 states have call predecessors, (80), 33 states have call successors, (80) [2023-11-22 23:02:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 357 transitions. [2023-11-22 23:02:32,824 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 357 transitions. Word has length 57 [2023-11-22 23:02:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:32,824 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 357 transitions. [2023-11-22 23:02:32,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 36 states have internal predecessors, (67), 19 states have call successors, (20), 15 states have call predecessors, (20), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:02:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 357 transitions. [2023-11-22 23:02:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-22 23:02:32,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:32,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:32,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-22 23:02:33,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:33,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:33,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1908661498, now seen corresponding path program 1 times [2023-11-22 23:02:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429048673] [2023-11-22 23:02:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 23:02:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 23:02:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 23:02:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 23:02:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429048673] [2023-11-22 23:02:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429048673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030133303] [2023-11-22 23:02:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:35,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:02:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 23:02:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:35,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 175 conjunts are in the unsatisfiable core [2023-11-22 23:02:35,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:35,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-11-22 23:02:35,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 23:02:35,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:35,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:35,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:35,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:35,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-22 23:02:37,963 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse4 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base))) is different from false [2023-11-22 23:02:38,108 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse4 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base))) is different from true [2023-11-22 23:02:38,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:38,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:02:38,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 23:02:38,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:02:38,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ 4294967294 (select (select (let ((.cse0 (store |c_#memory_int| |c_func_to_recursive_line_12_to_13_0_#in~d.base| v_ArrVal_436))) (store .cse0 |c_func_to_recursive_line_12_to_13_0_#in~e.base| (store (select .cse0 |c_func_to_recursive_line_12_to_13_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 0))) |c_func_to_recursive_line_12_to_13_0_#in~uint32_max.base|) |c_func_to_recursive_line_12_to_13_0_#in~uint32_max.offset|)) 4294967296) 0))) is different from false [2023-11-22 23:02:38,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ 4294967294 (select (select (let ((.cse0 (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436))) (store .cse0 c_func_to_recursive_line_12_to_13_0_~e.base (store (select .cse0 c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0))) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) 4294967296) 0))) is different from false [2023-11-22 23:02:39,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int)) (not (= (mod (+ (select (select (store (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436) c_func_to_recursive_line_12_to_13_0_~e.base (store (select (store (store (store |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~e.base v_ArrVal_446) c_func_to_recursive_line_12_to_13_0_~c.base v_ArrVal_435) c_func_to_recursive_line_12_to_13_0_~d.base v_ArrVal_436) c_func_to_recursive_line_12_to_13_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 0)) c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967294) 4294967296) 0))) is different from false [2023-11-22 23:02:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030133303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:39,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:02:39,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 50 [2023-11-22 23:02:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661750097] [2023-11-22 23:02:39,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:02:39,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-22 23:02:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:39,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-22 23:02:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3010, Unknown=27, NotChecked=452, Total=3660 [2023-11-22 23:02:39,077 INFO L87 Difference]: Start difference. First operand 263 states and 357 transitions. Second operand has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:02:40,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295))) (and (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 0) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~b.base)) (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) .cse4 (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse5 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~b.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~d.base)) (not (= c_func_to_recursive_line_12_to_13_0_~b.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) .cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 0))) is different from false [2023-11-22 23:02:40,866 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset) 4294967295))) (and (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~b.base) c_func_to_recursive_line_12_to_13_0_~b.offset) 0) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~b.base)) (or (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (let ((.cse2 (store |v_#memory_int_BEFORE_CALL_34| .cse1 (select |c_#memory_int| .cse1)))) (let ((.cse0 (@diff .cse2 |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_12_to_13_0_~d.base) (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse1 c_func_to_recursive_line_12_to_13_0_~e.base) (= (store .cse2 .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))))) (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse3 c_func_to_recursive_line_12_to_13_0_~e.base) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_34| .cse3 (select |c_#memory_int| .cse3)))))) .cse4 (exists ((|v_#memory_int_BEFORE_CALL_34| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_34| |c_#memory_int|))) (and (= 4294967295 (select (select |v_#memory_int_BEFORE_CALL_34| c_func_to_recursive_line_12_to_13_0_~uint32_max.base) c_func_to_recursive_line_12_to_13_0_~uint32_max.offset)) (= .cse5 c_func_to_recursive_line_12_to_13_0_~e.base) (= (@diff (store |v_#memory_int_BEFORE_CALL_34| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) c_func_to_recursive_line_12_to_13_0_~e.base))))) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~e.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~b.base)) (not (= c_func_to_recursive_line_12_to_13_0_~c.base c_func_to_recursive_line_12_to_13_0_~d.base)) (not (= c_func_to_recursive_line_12_to_13_0_~b.base c_func_to_recursive_line_12_to_13_0_~e.base)) (not (= c_func_to_recursive_line_12_to_13_0_~d.base c_func_to_recursive_line_12_to_13_0_~uint32_max.base)) .cse4 (= (select (select |c_#memory_int| c_func_to_recursive_line_12_to_13_0_~c.base) c_func_to_recursive_line_12_to_13_0_~c.offset) 0))) is different from true [2023-11-22 23:02:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:43,061 INFO L93 Difference]: Finished difference Result 611 states and 819 transitions. [2023-11-22 23:02:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-22 23:02:43,062 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2023-11-22 23:02:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:43,064 INFO L225 Difference]: With dead ends: 611 [2023-11-22 23:02:43,064 INFO L226 Difference]: Without dead ends: 425 [2023-11-22 23:02:43,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2727 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=948, Invalid=13085, Unknown=29, NotChecked=1190, Total=15252 [2023-11-22 23:02:43,067 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 297 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:43,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1035 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2139 Invalid, 0 Unknown, 280 Unchecked, 1.1s Time] [2023-11-22 23:02:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-22 23:02:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 323. [2023-11-22 23:02:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 227 states have (on average 1.277533039647577) internal successors, (290), 250 states have internal predecessors, (290), 45 states have call successors, (45), 39 states have call predecessors, (45), 50 states have return successors, (109), 35 states have call predecessors, (109), 43 states have call successors, (109) [2023-11-22 23:02:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 444 transitions. [2023-11-22 23:02:43,086 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 444 transitions. Word has length 59 [2023-11-22 23:02:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:43,086 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 444 transitions. [2023-11-22 23:02:43,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 36 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 23:02:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 444 transitions. [2023-11-22 23:02:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 23:02:43,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:43,088 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:43,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 23:02:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:43,300 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:43,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1753822486, now seen corresponding path program 3 times [2023-11-22 23:02:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528909223] [2023-11-22 23:02:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 23:02:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 23:02:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528909223] [2023-11-22 23:02:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528909223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702844217] [2023-11-22 23:02:45,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 23:02:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:45,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:02:45,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 23:02:45,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-22 23:02:45,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:02:45,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 169 conjunts are in the unsatisfiable core [2023-11-22 23:02:45,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:45,507 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:02:45,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-11-22 23:02:46,191 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:02:46,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-11-22 23:02:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 23:02:46,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:02:46,494 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_518))) (= (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~b.base) c_func_to_recursive_line_14_to_16_0_~b.offset) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_14_to_16_0_~a.base) c_func_to_recursive_line_14_to_16_0_~a.offset) 4294967296))))) is different from false [2023-11-22 23:02:46,592 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-22 23:02:46,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 85 [2023-11-22 23:02:46,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 23:02:46,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 57 [2023-11-22 23:02:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 23:02:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702844217] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:02:47,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:02:47,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 54 [2023-11-22 23:02:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724781228] [2023-11-22 23:02:47,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:02:47,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-22 23:02:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:02:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-22 23:02:47,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2612, Unknown=16, NotChecked=102, Total=2862 [2023-11-22 23:02:47,298 INFO L87 Difference]: Start difference. First operand 323 states and 444 transitions. Second operand has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 23:02:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:02:50,895 INFO L93 Difference]: Finished difference Result 718 states and 1053 transitions. [2023-11-22 23:02:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-22 23:02:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 60 [2023-11-22 23:02:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:02:50,899 INFO L225 Difference]: With dead ends: 718 [2023-11-22 23:02:50,900 INFO L226 Difference]: Without dead ends: 411 [2023-11-22 23:02:50,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=583, Invalid=8332, Unknown=19, NotChecked=186, Total=9120 [2023-11-22 23:02:50,904 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 231 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:02:50,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 837 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1760 Invalid, 0 Unknown, 95 Unchecked, 1.1s Time] [2023-11-22 23:02:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-22 23:02:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 380. [2023-11-22 23:02:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 272 states have (on average 1.2463235294117647) internal successors, (339), 299 states have internal predecessors, (339), 49 states have call successors, (49), 43 states have call predecessors, (49), 58 states have return successors, (140), 39 states have call predecessors, (140), 47 states have call successors, (140) [2023-11-22 23:02:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 528 transitions. [2023-11-22 23:02:50,942 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 528 transitions. Word has length 60 [2023-11-22 23:02:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:02:50,943 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 528 transitions. [2023-11-22 23:02:50,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 46 states have (on average 2.282608695652174) internal successors, (105), 37 states have internal predecessors, (105), 20 states have call successors, (26), 19 states have call predecessors, (26), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 23:02:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 528 transitions. [2023-11-22 23:02:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-22 23:02:50,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:02:50,946 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:02:50,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-22 23:02:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-22 23:02:51,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:02:51,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:02:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1057413923, now seen corresponding path program 4 times [2023-11-22 23:02:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:02:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220364591] [2023-11-22 23:02:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:02:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:02:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 23:02:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-22 23:02:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:02:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 62 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 23:02:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:02:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220364591] [2023-11-22 23:02:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220364591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:02:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632980726] [2023-11-22 23:02:53,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 23:02:53,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:02:53,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:02:53,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:02:53,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 23:02:53,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 23:02:53,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 23:02:53,439 WARN L260 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 398 conjunts are in the unsatisfiable core [2023-11-22 23:02:53,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:02:53,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-22 23:02:53,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-11-22 23:02:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-22 23:02:53,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:02:53,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-22 23:02:53,487 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-22 23:02:53,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2023-11-22 23:02:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:02:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-22 23:02:54,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-22 23:02:54,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-22 23:02:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 23:02:55,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:03:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632980726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:03:09,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:03:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2023-11-22 23:03:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484474816] [2023-11-22 23:03:09,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:03:09,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-22 23:03:09,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:03:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-22 23:03:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2884, Unknown=51, NotChecked=0, Total=3080 [2023-11-22 23:03:09,354 INFO L87 Difference]: Start difference. First operand 380 states and 528 transitions. Second operand has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:03:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:03:13,481 INFO L93 Difference]: Finished difference Result 756 states and 1103 transitions. [2023-11-22 23:03:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-22 23:03:13,482 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2023-11-22 23:03:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:03:13,483 INFO L225 Difference]: With dead ends: 756 [2023-11-22 23:03:13,484 INFO L226 Difference]: Without dead ends: 392 [2023-11-22 23:03:13,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=333, Invalid=5934, Unknown=53, NotChecked=0, Total=6320 [2023-11-22 23:03:13,485 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 23:03:13,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 834 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 23:03:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-22 23:03:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 384. [2023-11-22 23:03:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 274 states have (on average 1.2445255474452555) internal successors, (341), 301 states have internal predecessors, (341), 49 states have call successors, (49), 43 states have call predecessors, (49), 60 states have return successors, (170), 41 states have call predecessors, (170), 47 states have call successors, (170) [2023-11-22 23:03:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 560 transitions. [2023-11-22 23:03:13,524 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 560 transitions. Word has length 74 [2023-11-22 23:03:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:03:13,525 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 560 transitions. [2023-11-22 23:03:13,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 15 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:03:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 560 transitions. [2023-11-22 23:03:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 23:03:13,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:03:13,526 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:03:13,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 23:03:13,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:03:13,740 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:03:13,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:03:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2028344313, now seen corresponding path program 1 times [2023-11-22 23:03:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:03:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748080057] [2023-11-22 23:03:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:03:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:03:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:03:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:03:15,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:03:15,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748080057] [2023-11-22 23:03:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748080057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:03:15,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492285337] [2023-11-22 23:03:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:03:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:03:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:03:15,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:03:15,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 23:03:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:03:16,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 267 conjunts are in the unsatisfiable core [2023-11-22 23:03:16,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:03:16,183 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:03:16,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2023-11-22 23:03:16,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-22 23:03:16,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:03:16,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:03:16,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:03:16,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-22 23:03:16,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-22 23:03:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 23:03:17,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 23:03:17,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 23:03:17,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-22 23:03:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 4 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:03:18,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:03:20,521 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_func_to_recursive_line_11_to_12_0_#in~c.base| v_ArrVal_692))) (store .cse2 |c_func_to_recursive_line_11_to_12_0_#in~d.base| (store (select .cse2 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_11_to_12_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= 4 (mod (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (not (= (mod (+ 4294967294 (select (select .cse0 |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.base|) |c_func_to_recursive_line_11_to_12_0_#in~uint32_max.offset|)) 4294967296) 4))))) is different from false [2023-11-22 23:03:20,534 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~c.base v_ArrVal_692))) (store .cse2 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse2 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 c_func_to_recursive_line_10_to_11_0_~e.base (store (select .cse1 c_func_to_recursive_line_10_to_11_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ 4294967294 (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) c_func_to_recursive_line_10_to_11_0_~uint32_max.offset)) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 23:03:20,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base v_ArrVal_691) c_func_to_recursive_line_10_to_11_0_~c.base v_ArrVal_692))) (store .cse2 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse2 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 c_func_to_recursive_line_10_to_11_0_~e.base (store (select .cse1 c_func_to_recursive_line_10_to_11_0_~e.base) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ 4294967294 (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) c_func_to_recursive_line_10_to_11_0_~uint32_max.offset)) 4294967296) 4)) (not (= (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 23:03:20,562 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base| v_ArrVal_691) |c_func_to_recursive_line_10_to_11_0_#in~c.base| v_ArrVal_692))) (store .cse2 |c_func_to_recursive_line_10_to_11_0_#in~d.base| (store (select .cse2 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_func_to_recursive_line_10_to_11_0_#in~e.base| (store (select .cse1 |c_func_to_recursive_line_10_to_11_0_#in~e.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= 4 (mod (+ 4294967294 (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.offset|)) 4294967296))) (not (= (mod (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 23:03:20,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_691) |c_ULTIMATE.start_main_~#c~0#1.base| v_ArrVal_692))) (store .cse2 |c_ULTIMATE.start_main_~#d~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))))) (store .cse1 |c_ULTIMATE.start_main_~#e~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#e~0#1.base|) func_to_recursive_line_13_to_14_0_~e.offset 4))))) (or (not (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) |c_ULTIMATE.start_main_~#uint32_max~0#1.offset|) 4294967294) 4294967296) 4)) (not (= (mod (select (select .cse0 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296) 4))))) is different from false [2023-11-22 23:03:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:03:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492285337] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:03:20,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:03:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 27] total 81 [2023-11-22 23:03:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968288770] [2023-11-22 23:03:20,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:03:20,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-22 23:03:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:03:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-22 23:03:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5453, Unknown=32, NotChecked=770, Total=6642 [2023-11-22 23:03:20,582 INFO L87 Difference]: Start difference. First operand 384 states and 560 transitions. Second operand has 82 states, 68 states have (on average 2.7794117647058822) internal successors, (189), 54 states have internal predecessors, (189), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 23:04:32,638 WARN L293 SmtUtils]: Spent 18.50s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 23:05:24,374 WARN L293 SmtUtils]: Spent 10.72s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 23:05:26,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 23:06:25,727 WARN L293 SmtUtils]: Spent 18.37s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 23:06:28,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 23:06:30,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15