./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:48:45,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:48:46,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:48:46,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:48:46,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:48:46,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:48:46,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:48:46,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:48:46,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:48:46,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:48:46,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:48:46,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:48:46,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:48:46,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:48:46,073 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:48:46,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:48:46,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:48:46,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:48:46,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:48:46,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:48:46,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:48:46,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:48:46,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:48:46,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:48:46,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:48:46,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:48:46,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:48:46,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:48:46,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:48:46,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:48:46,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:48:46,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:48:46,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:48:46,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:48:46,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:48:46,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:48:46,081 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-10-12 19:48:46,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:48:46,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:48:46,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:48:46,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:48:46,296 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:48:46,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-12 19:48:47,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:48:47,586 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:48:47,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-10-12 19:48:47,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d07812e/fe9f6b1db2854d149f8dcd6a5bceab02/FLAGd129b542d [2024-10-12 19:48:47,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d07812e/fe9f6b1db2854d149f8dcd6a5bceab02 [2024-10-12 19:48:47,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:48:47,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:48:47,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:48:47,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:48:47,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:48:47,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404322b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47, skipping insertion in model container [2024-10-12 19:48:47,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:48:47,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-12 19:48:47,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:48:47,799 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:48:47,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-10-12 19:48:47,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:48:47,822 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:48:47,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47 WrapperNode [2024-10-12 19:48:47,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:48:47,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:48:47,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:48:47,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:48:47,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,847 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2024-10-12 19:48:47,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:48:47,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:48:47,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:48:47,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:48:47,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,876 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-10-12 19:48:47,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:48:47,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:48:47,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:48:47,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:48:47,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (1/1) ... [2024-10-12 19:48:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:48:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:47,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:48:47,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:48:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:48:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:48:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:48:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:48:47,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 19:48:47,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 19:48:47,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 19:48:47,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 19:48:47,965 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-10-12 19:48:47,966 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-10-12 19:48:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:48:47,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:48:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 19:48:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 19:48:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 19:48:47,966 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-10-12 19:48:47,966 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-10-12 19:48:47,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 19:48:48,033 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:48:48,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:48:48,160 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 19:48:48,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:48:48,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:48:48,188 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 19:48:48,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:48 BoogieIcfgContainer [2024-10-12 19:48:48,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:48:48,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:48:48,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:48:48,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:48:48,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:48:47" (1/3) ... [2024-10-12 19:48:48,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3076d699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:48:48, skipping insertion in model container [2024-10-12 19:48:48,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:48:47" (2/3) ... [2024-10-12 19:48:48,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3076d699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:48:48, skipping insertion in model container [2024-10-12 19:48:48,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:48" (3/3) ... [2024-10-12 19:48:48,197 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-10-12 19:48:48,211 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:48:48,211 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:48:48,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:48:48,261 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a1803c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:48:48,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:48:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:48:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 19:48:48,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:48,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:48,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:48,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 855928239, now seen corresponding path program 1 times [2024-10-12 19:48:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026969505] [2024-10-12 19:48:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:48,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:48:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026969505] [2024-10-12 19:48:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026969505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:48:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:48:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:48:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633264575] [2024-10-12 19:48:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:48:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:48:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:48:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:48:48,705 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:48:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:48,838 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-12 19:48:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:48:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-12 19:48:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:48,848 INFO L225 Difference]: With dead ends: 32 [2024-10-12 19:48:48,848 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 19:48:48,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:48:48,854 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:48,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 19:48:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-12 19:48:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-12 19:48:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-12 19:48:48,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2024-10-12 19:48:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:48,886 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 19:48:48,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:48:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-12 19:48:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:48:48,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:48,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:48:48,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:48,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash 255373073, now seen corresponding path program 1 times [2024-10-12 19:48:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772353569] [2024-10-12 19:48:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:48:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:48:49,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:49,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772353569] [2024-10-12 19:48:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772353569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:48:49,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:48:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:48:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192742498] [2024-10-12 19:48:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:48:49,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:48:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:48:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:48:49,179 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:48:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:49,264 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-12 19:48:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:48:49,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2024-10-12 19:48:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:49,266 INFO L225 Difference]: With dead ends: 42 [2024-10-12 19:48:49,266 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 19:48:49,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:48:49,267 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:49,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 19:48:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 19:48:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 19:48:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-12 19:48:49,274 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2024-10-12 19:48:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-12 19:48:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:48:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-12 19:48:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 19:48:49,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:49,276 INFO L215 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] [2024-10-12 19:48:49,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:48:49,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:49,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1037516303, now seen corresponding path program 1 times [2024-10-12 19:48:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778179896] [2024-10-12 19:48:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:48:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 19:48:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778179896] [2024-10-12 19:48:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778179896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009521657] [2024-10-12 19:48:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:49,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:48:49,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:48:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:49,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 19:48:49,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:49,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:48:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 19:48:50,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:48:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009521657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:50,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-10-12 19:48:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897927214] [2024-10-12 19:48:50,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 19:48:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 19:48:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:48:50,402 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-12 19:48:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:50,685 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-12 19:48:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:48:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) Word has length 26 [2024-10-12 19:48:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:50,687 INFO L225 Difference]: With dead ends: 48 [2024-10-12 19:48:50,687 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 19:48:50,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 19:48:50,688 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:50,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 80 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 19:48:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 19:48:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 19:48:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 19:48:50,696 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2024-10-12 19:48:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 19:48:50,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-12 19:48:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-12 19:48:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:48:50,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:50,702 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:50,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:48:50,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:50,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:50,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1013053495, now seen corresponding path program 2 times [2024-10-12 19:48:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573097254] [2024-10-12 19:48:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:50,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:48:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:48:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-12 19:48:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573097254] [2024-10-12 19:48:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573097254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123533384] [2024-10-12 19:48:51,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:48:51,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:51,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:48:51,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:48:51,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:48:51,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:48:51,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 19:48:51,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:51,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:48:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:48:51,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 19:48:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123533384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:52,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 30 [2024-10-12 19:48:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076363117] [2024-10-12 19:48:52,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 19:48:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:52,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 19:48:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-10-12 19:48:52,530 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 30 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-12 19:48:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:52,736 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-10-12 19:48:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:48:52,737 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Word has length 52 [2024-10-12 19:48:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:52,737 INFO L225 Difference]: With dead ends: 56 [2024-10-12 19:48:52,737 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 19:48:52,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 19:48:52,739 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:52,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 155 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:48:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 19:48:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 19:48:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-12 19:48:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-12 19:48:52,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 52 [2024-10-12 19:48:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:52,743 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 19:48:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 2.090909090909091) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-12 19:48:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-12 19:48:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:48:52,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:52,745 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:52,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:48:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 19:48:52,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1958161335, now seen corresponding path program 3 times [2024-10-12 19:48:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446600052] [2024-10-12 19:48:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:48:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:48:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-12 19:48:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446600052] [2024-10-12 19:48:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446600052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872964398] [2024-10-12 19:48:53,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:48:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:53,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:53,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:48:53,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:48:54,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 19:48:54,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:48:54,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-12 19:48:54,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:54,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:48:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-12 19:48:54,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-12 19:48:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872964398] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:54,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-10-12 19:48:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907571073] [2024-10-12 19:48:54,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:54,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 19:48:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:54,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 19:48:54,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 19:48:54,966 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 35 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 29 states have internal predecessors, (50), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-12 19:48:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:55,312 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-10-12 19:48:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:48:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 29 states have internal predecessors, (50), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) Word has length 72 [2024-10-12 19:48:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:55,315 INFO L225 Difference]: With dead ends: 64 [2024-10-12 19:48:55,315 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 19:48:55,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2024-10-12 19:48:55,317 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:55,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 147 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:48:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 19:48:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 19:48:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-12 19:48:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-12 19:48:55,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 72 [2024-10-12 19:48:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-12 19:48:55,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 29 states have internal predecessors, (50), 13 states have call successors, (17), 7 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-12 19:48:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-12 19:48:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 19:48:55,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:55,325 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:55,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:48:55,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:55,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:55,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 620375637, now seen corresponding path program 4 times [2024-10-12 19:48:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:55,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160916453] [2024-10-12 19:48:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:48:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:48:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:48:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:48:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:48:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:48:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 307 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-10-12 19:48:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:48:57,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160916453] [2024-10-12 19:48:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160916453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:48:57,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728326492] [2024-10-12 19:48:57,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:48:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:48:57,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:48:57,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:48:57,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:48:57,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:48:57,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-12 19:48:57,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:48:57,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:48:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 522 proven. 35 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-10-12 19:48:57,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:48:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 180 proven. 242 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-12 19:48:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728326492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:48:59,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:48:59,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 40 [2024-10-12 19:48:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864970117] [2024-10-12 19:48:59,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:48:59,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-12 19:48:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:48:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 19:48:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 19:48:59,223 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 40 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (26), 12 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-12 19:48:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:48:59,459 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-10-12 19:48:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:48:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (26), 12 states have call predecessors, (26), 10 states have call successors, (26) Word has length 118 [2024-10-12 19:48:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:48:59,460 INFO L225 Difference]: With dead ends: 70 [2024-10-12 19:48:59,460 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 19:48:59,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=410, Invalid=1482, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 19:48:59,462 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:48:59,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:48:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 19:48:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-12 19:48:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:48:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-12 19:48:59,467 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 118 [2024-10-12 19:48:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:48:59,467 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-12 19:48:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (26), 12 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-12 19:48:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-12 19:48:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 19:48:59,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:48:59,470 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:48:59,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:48:59,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:48:59,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:48:59,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:48:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash -149039543, now seen corresponding path program 5 times [2024-10-12 19:48:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:48:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706858390] [2024-10-12 19:48:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:48:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:48:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-10-12 19:49:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706858390] [2024-10-12 19:49:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706858390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886056380] [2024-10-12 19:49:00,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 19:49:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:00,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:00,910 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) [2024-10-12 19:49:00,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:49:01,292 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-12 19:49:01,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:49:01,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-12 19:49:01,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:01,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:49:01,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-12 19:49:01,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 19:49:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2024-10-12 19:49:01,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886056380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:01,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:49:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2024-10-12 19:49:01,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027930361] [2024-10-12 19:49:01,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:01,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 19:49:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 19:49:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:49:01,858 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 24 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-12 19:49:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:01,964 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-12 19:49:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:49:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) Word has length 133 [2024-10-12 19:49:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:01,966 INFO L225 Difference]: With dead ends: 48 [2024-10-12 19:49:01,966 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 19:49:01,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2024-10-12 19:49:01,967 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:01,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:49:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 19:49:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-10-12 19:49:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (17), 14 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-12 19:49:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-12 19:49:01,976 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 133 [2024-10-12 19:49:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:01,976 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-12 19:49:01,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-12 19:49:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-12 19:49:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 19:49:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:49:01,980 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:49:01,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 19:49:02,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:02,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:49:02,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:49:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash -149037621, now seen corresponding path program 1 times [2024-10-12 19:49:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:49:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113946511] [2024-10-12 19:49:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:49:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-10-12 19:49:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113946511] [2024-10-12 19:49:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113946511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024653602] [2024-10-12 19:49:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:03,318 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) [2024-10-12 19:49:03,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 19:49:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:03,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-12 19:49:03,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:03,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:49:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-10-12 19:49:03,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-10-12 19:49:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024653602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:49:04,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:49:04,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 37 [2024-10-12 19:49:04,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931920861] [2024-10-12 19:49:04,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:04,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-12 19:49:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-12 19:49:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 19:49:04,587 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-10-12 19:49:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:04,808 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-12 19:49:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:49:04,808 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) Word has length 133 [2024-10-12 19:49:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:04,809 INFO L225 Difference]: With dead ends: 46 [2024-10-12 19:49:04,809 INFO L226 Difference]: Without dead ends: 41 [2024-10-12 19:49:04,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1448, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 19:49:04,810 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:04,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 105 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:49:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-12 19:49:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-12 19:49:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-12 19:49:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-10-12 19:49:04,815 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 133 [2024-10-12 19:49:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:04,816 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-12 19:49:04,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 15 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-10-12 19:49:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-10-12 19:49:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-12 19:49:04,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:49:04,817 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:49:04,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:49:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:05,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:49:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:49:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1394731601, now seen corresponding path program 6 times [2024-10-12 19:49:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:49:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745872272] [2024-10-12 19:49:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:49:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-10-12 19:49:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745872272] [2024-10-12 19:49:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745872272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810140690] [2024-10-12 19:49:07,910 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 19:49:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:07,911 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) [2024-10-12 19:49:07,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 19:49:09,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-10-12 19:49:09,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:49:09,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 178 conjuncts are in the unsatisfiable core [2024-10-12 19:49:09,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:09,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-10-12 19:49:09,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 19:49:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 1192 proven. 141 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2024-10-12 19:49:09,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:10,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-12 19:49:11,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-12 19:49:11,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-12 19:49:11,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-12 19:49:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810140690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:12,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:49:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2024-10-12 19:49:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026417079] [2024-10-12 19:49:12,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:12,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 19:49:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:12,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 19:49:12,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 19:49:12,086 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 33 states have internal predecessors, (51), 13 states have call successors, (15), 3 states have call predecessors, (15), 15 states have return successors, (21), 18 states have call predecessors, (21), 13 states have call successors, (21) [2024-10-12 19:49:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:13,126 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2024-10-12 19:49:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-12 19:49:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 33 states have internal predecessors, (51), 13 states have call successors, (15), 3 states have call predecessors, (15), 15 states have return successors, (21), 18 states have call predecessors, (21), 13 states have call successors, (21) Word has length 215 [2024-10-12 19:49:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:13,128 INFO L225 Difference]: With dead ends: 79 [2024-10-12 19:49:13,128 INFO L226 Difference]: Without dead ends: 75 [2024-10-12 19:49:13,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=4907, Unknown=0, NotChecked=0, Total=5402 [2024-10-12 19:49:13,129 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:13,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 66 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:49:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-12 19:49:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-10-12 19:49:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 21 states have return successors, (37), 22 states have call predecessors, (37), 5 states have call successors, (37) [2024-10-12 19:49:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-10-12 19:49:13,146 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 215 [2024-10-12 19:49:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-10-12 19:49:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 33 states have internal predecessors, (51), 13 states have call successors, (15), 3 states have call predecessors, (15), 15 states have return successors, (21), 18 states have call predecessors, (21), 13 states have call successors, (21) [2024-10-12 19:49:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-10-12 19:49:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-12 19:49:13,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:49:13,152 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:49:13,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:49:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:13,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:49:13,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:49:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1394733523, now seen corresponding path program 2 times [2024-10-12 19:49:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:49:13,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826823244] [2024-10-12 19:49:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:49:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-10-12 19:49:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826823244] [2024-10-12 19:49:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826823244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19172795] [2024-10-12 19:49:16,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:49:16,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:16,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:49:16,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 19:49:16,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:49:16,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:49:16,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-12 19:49:16,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:16,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:49:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-10-12 19:49:16,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-10-12 19:49:18,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19172795] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:49:18,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:49:18,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 26] total 46 [2024-10-12 19:49:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507383118] [2024-10-12 19:49:18,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:18,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-12 19:49:18,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-12 19:49:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2024-10-12 19:49:18,562 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-12 19:49:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:18,791 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2024-10-12 19:49:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:49:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) Word has length 215 [2024-10-12 19:49:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:18,793 INFO L225 Difference]: With dead ends: 70 [2024-10-12 19:49:18,793 INFO L226 Difference]: Without dead ends: 65 [2024-10-12 19:49:18,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 478 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2024-10-12 19:49:18,794 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:18,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:49:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-12 19:49:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-12 19:49:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 22 states have return successors, (38), 23 states have call predecessors, (38), 5 states have call successors, (38) [2024-10-12 19:49:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-10-12 19:49:18,808 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 215 [2024-10-12 19:49:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-10-12 19:49:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-10-12 19:49:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-10-12 19:49:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-12 19:49:18,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:49:18,811 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 40, 40, 40, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:49:18,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 19:49:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 19:49:19,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:49:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:49:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 813985921, now seen corresponding path program 3 times [2024-10-12 19:49:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:49:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060427537] [2024-10-12 19:49:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:49:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:49:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:49:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:49:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:49:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5049 backedges. 67 proven. 1069 refuted. 0 times theorem prover too weak. 3913 trivial. 0 not checked. [2024-10-12 19:49:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060427537] [2024-10-12 19:49:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060427537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109841113] [2024-10-12 19:49:21,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:49:21,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:21,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:21,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:49:21,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 19:49:22,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-10-12 19:49:22,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:49:22,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 177 conjuncts are in the unsatisfiable core [2024-10-12 19:49:22,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:22,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-12 19:49:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5049 backedges. 3053 proven. 156 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2024-10-12 19:49:23,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5049 backedges. 908 proven. 559 refuted. 0 times theorem prover too weak. 3582 trivial. 0 not checked. [2024-10-12 19:49:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109841113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:49:26,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:49:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 30] total 47 [2024-10-12 19:49:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540946562] [2024-10-12 19:49:26,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-12 19:49:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-12 19:49:26,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 19:49:26,400 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 47 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 38 states have internal predecessors, (65), 19 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (35), 10 states have call predecessors, (35), 19 states have call successors, (35) [2024-10-12 19:49:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:27,094 INFO L93 Difference]: Finished difference Result 125 states and 205 transitions. [2024-10-12 19:49:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-12 19:49:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 38 states have internal predecessors, (65), 19 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (35), 10 states have call predecessors, (35), 19 states have call successors, (35) Word has length 276 [2024-10-12 19:49:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:27,096 INFO L225 Difference]: With dead ends: 125 [2024-10-12 19:49:27,096 INFO L226 Difference]: Without dead ends: 60 [2024-10-12 19:49:27,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 622 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1177, Invalid=4523, Unknown=0, NotChecked=0, Total=5700 [2024-10-12 19:49:27,098 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 101 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:27,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 286 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:49:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-12 19:49:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-12 19:49:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 14 states have return successors, (15), 14 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-12 19:49:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-10-12 19:49:27,106 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 276 [2024-10-12 19:49:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:27,107 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-10-12 19:49:27,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 38 states have internal predecessors, (65), 19 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (35), 10 states have call predecessors, (35), 19 states have call successors, (35) [2024-10-12 19:49:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2024-10-12 19:49:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 19:49:27,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:49:27,108 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:49:27,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 19:49:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:27,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:49:27,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:49:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1043831351, now seen corresponding path program 4 times [2024-10-12 19:49:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:49:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48658552] [2024-10-12 19:49:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:49:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:49:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:49:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:49:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:49:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:49:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-10-12 19:49:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:49:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48658552] [2024-10-12 19:49:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48658552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137442079] [2024-10-12 19:49:29,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:49:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:49:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:49:29,257 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:49:29,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 19:49:29,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:49:29,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:49:29,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-12 19:49:29,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:49:29,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-12 19:49:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-10-12 19:49:29,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:49:30,585 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-12 19:49:30,585 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 44 treesize of output 32 [2024-10-12 19:49:30,994 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-12 19:49:30,995 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 44 treesize of output 32 [2024-10-12 19:49:31,311 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-12 19:49:31,311 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 44 treesize of output 32 [2024-10-12 19:49:31,545 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-12 19:49:31,545 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 44 treesize of output 32 [2024-10-12 19:49:31,689 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-12 19:49:31,690 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 44 treesize of output 32 [2024-10-12 19:49:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137442079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:49:32,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:49:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2024-10-12 19:49:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998332177] [2024-10-12 19:49:32,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 19:49:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 19:49:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:49:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 19:49:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=434, Unknown=1, NotChecked=0, Total=506 [2024-10-12 19:49:32,607 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-12 19:49:36,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 19:49:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:49:36,835 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-10-12 19:49:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:49:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 256 [2024-10-12 19:49:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:49:36,837 INFO L225 Difference]: With dead ends: 64 [2024-10-12 19:49:36,837 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:49:36,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=773, Unknown=1, NotChecked=0, Total=930 [2024-10-12 19:49:36,838 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:49:36,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:49:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:49:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:49:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:49:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:49:36,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-10-12 19:49:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:49:36,839 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:49:36,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-12 19:49:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:49:36,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:49:36,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:49:36,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-12 19:49:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 19:49:37,045 INFO L407 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1] [2024-10-12 19:49:37,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:49:39,026 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:49:39,035 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: (= (select (select |#memory_int#2| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset|) 6) [2024-10-12 19:49:39,049 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:49:39,049 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 19:49:39,049 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 19:49:39,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-10-12 19:49:39,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-10-12 19:49:39,053 WARN L155 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_61| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_61| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_61|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_61|) 5))) Eliminated clause: (exists ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_61| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_61| Int)) (<= (select (select |#memory_int#1| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_61|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_61|) 5)) [2024-10-12 19:49:39,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:49:39,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:49:39,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:49:39,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:49:39 BoogieIcfgContainer [2024-10-12 19:49:39,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:49:39,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:49:39,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:49:39,059 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:49:39,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:48:48" (3/4) ... [2024-10-12 19:49:39,061 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:49:39,063 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-10-12 19:49:39,064 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-10-12 19:49:39,066 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-12 19:49:39,066 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-12 19:49:39,066 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 19:49:39,066 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:49:39,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:49:39,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:49:39,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:49:39,125 INFO L158 Benchmark]: Toolchain (without parser) took 51518.48ms. Allocated memory was 125.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 56.8MB in the beginning and 813.3MB in the end (delta: -756.5MB). Peak memory consumption was 470.2MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,125 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 125.8MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:49:39,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.97ms. Allocated memory is still 178.3MB. Free memory was 151.0MB in the beginning and 140.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 178.3MB. Free memory was 140.4MB in the beginning and 139.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,126 INFO L158 Benchmark]: Boogie Preprocessor took 35.46ms. Allocated memory is still 178.3MB. Free memory was 139.4MB in the beginning and 137.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,126 INFO L158 Benchmark]: RCFGBuilder took 304.61ms. Allocated memory is still 178.3MB. Free memory was 137.3MB in the beginning and 123.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,126 INFO L158 Benchmark]: TraceAbstraction took 50866.41ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 122.6MB in the beginning and 817.5MB in the end (delta: -694.9MB). Peak memory consumption was 476.4MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,126 INFO L158 Benchmark]: Witness Printer took 66.09ms. Allocated memory is still 1.4GB. Free memory was 817.5MB in the beginning and 813.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:49:39,127 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.07ms. Allocated memory is still 125.8MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.97ms. Allocated memory is still 178.3MB. Free memory was 151.0MB in the beginning and 140.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 178.3MB. Free memory was 140.4MB in the beginning and 139.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.46ms. Allocated memory is still 178.3MB. Free memory was 139.4MB in the beginning and 137.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.61ms. Allocated memory is still 178.3MB. Free memory was 137.3MB in the beginning and 123.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50866.41ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 122.6MB in the beginning and 817.5MB in the end (delta: -694.9MB). Peak memory consumption was 476.4MB. Max. memory is 16.1GB. * Witness Printer took 66.09ms. Allocated memory is still 1.4GB. Free memory was 817.5MB in the beginning and 813.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.8s, OverallIterations: 12, TraceHistogramMax: 46, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 1430 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1288 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3229 IncrementalHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 142 mSDtfsCounter, 3229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3276 GetRequests, 2790 SyntacticMatches, 26 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=10, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 34.3s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3886 ConstructedInterpolants, 34 QuantifiedInterpolants, 13535 SizeOfPredicates, 147 NumberOfNonLiveVariables, 5672 ConjunctsInSsa, 792 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 43359/46398 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-12 19:49:39,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE