/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_geo2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 00:25:33,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 00:25:33,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 00:25:33,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 00:25:33,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 00:25:33,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 00:25:33,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 00:25:33,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 00:25:33,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 00:25:33,604 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 00:25:33,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 00:25:33,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 00:25:33,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 00:25:33,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 00:25:33,606 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 00:25:33,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 00:25:33,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 00:25:33,607 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 00:25:33,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 00:25:33,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 00:25:33,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 00:25:33,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 00:25:33,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 00:25:33,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 00:25:33,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 00:25:33,609 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 00:25:33,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 00:25:33,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 00:25:33,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 00:25:33,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 00:25:33,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:25:33,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 00:25:33,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 00:25:33,612 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 00:25:33,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 00:25:33,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 00:25:33,612 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: Use bitabs translation -> true [2023-12-20 00:25:33,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 00:25:33,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 00:25:33,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 00:25:33,849 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 00:25:33,849 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 00:25:33,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_geo2-ll.c [2023-12-20 00:25:34,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 00:25:34,929 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 00:25:34,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_geo2-ll.c [2023-12-20 00:25:34,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ce08b91/828b2f7ff660496b8faf58dc31f02660/FLAG775bff3ef [2023-12-20 00:25:34,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ce08b91/828b2f7ff660496b8faf58dc31f02660 [2023-12-20 00:25:34,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 00:25:34,948 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 00:25:34,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 00:25:34,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 00:25:34,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 00:25:34,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:25:34" (1/1) ... [2023-12-20 00:25:34,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96f1112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:34, skipping insertion in model container [2023-12-20 00:25:34,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:25:34" (1/1) ... [2023-12-20 00:25:34,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 00:25:35,077 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_geo2-ll.c[1055,1068] [2023-12-20 00:25:35,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:25:35,094 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 00:25:35,106 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_geo2-ll.c[1055,1068] [2023-12-20 00:25:35,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:25:35,120 INFO L206 MainTranslator]: Completed translation [2023-12-20 00:25:35,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35 WrapperNode [2023-12-20 00:25:35,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 00:25:35,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 00:25:35,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 00:25:35,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 00:25:35,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,157 INFO L138 Inliner]: procedures = 16, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2023-12-20 00:25:35,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 00:25:35,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 00:25:35,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 00:25:35,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 00:25:35,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,188 INFO L175 MemorySlicer]: Split 27 memory accesses to 6 slices as follows [2, 4, 7, 5, 7, 2]. 26 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 8 writes are split as follows [0, 2, 2, 2, 1, 1]. [2023-12-20 00:25:35,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 00:25:35,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 00:25:35,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 00:25:35,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 00:25:35,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (1/1) ... [2023-12-20 00:25:35,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:25:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:25:35,237 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) [2023-12-20 00:25:35,259 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 [2023-12-20 00:25:35,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 00:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 00:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 00:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 00:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-20 00:25:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-20 00:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-20 00:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 00:25:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2023-12-20 00:25:35,267 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 00:25:35,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 00:25:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 00:25:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 00:25:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-20 00:25:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-20 00:25:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-20 00:25:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-20 00:25:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-20 00:25:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 00:25:35,358 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 00:25:35,361 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 00:25:35,514 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 00:25:35,549 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 00:25:35,550 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 00:25:35,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:25:35 BoogieIcfgContainer [2023-12-20 00:25:35,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 00:25:35,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 00:25:35,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 00:25:35,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 00:25:35,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:25:34" (1/3) ... [2023-12-20 00:25:35,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793608ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:25:35, skipping insertion in model container [2023-12-20 00:25:35,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:25:35" (2/3) ... [2023-12-20 00:25:35,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793608ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:25:35, skipping insertion in model container [2023-12-20 00:25:35,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:25:35" (3/3) ... [2023-12-20 00:25:35,556 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_geo2-ll.c [2023-12-20 00:25:35,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 00:25:35,574 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 00:25:35,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 00:25:35,618 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b5734cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 00:25:35,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 00:25:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 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) [2023-12-20 00:25:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-20 00:25:35,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:25:35,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:25:35,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:25:35,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:25:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1288934217, now seen corresponding path program 1 times [2023-12-20 00:25:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:25:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785251305] [2023-12-20 00:25:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:25:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:25:35,784 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 00:25:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434117990] [2023-12-20 00:25:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:25:35,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:25:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:25:35,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:25:35,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 00:25:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:25:35,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-20 00:25:35,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:25:36,000 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 [2023-12-20 00:25:36,006 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 [2023-12-20 00:25:36,110 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 [2023-12-20 00:25:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:25:36,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:25:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:25:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785251305] [2023-12-20 00:25:36,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 00:25:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434117990] [2023-12-20 00:25:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434117990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:25:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:25:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:25:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207006786] [2023-12-20 00:25:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:25:36,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:25:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:25:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:25:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:25:36,200 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 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 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 00:25:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:25:36,373 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-12-20 00:25:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 00:25:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-20 00:25:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:25:36,381 INFO L225 Difference]: With dead ends: 52 [2023-12-20 00:25:36,381 INFO L226 Difference]: Without dead ends: 31 [2023-12-20 00:25:36,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:25:36,392 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:25:36,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 72 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:25:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-20 00:25:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-20 00:25:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-20 00:25:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-20 00:25:36,426 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2023-12-20 00:25:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:25:36,426 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-20 00:25:36,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 00:25:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-20 00:25:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-20 00:25:36,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:25:36,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:25:36,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 00:25:36,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-20 00:25:36,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:25:36,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:25:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1531368910, now seen corresponding path program 1 times [2023-12-20 00:25:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:25:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650897321] [2023-12-20 00:25:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:25:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:25:36,657 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 00:25:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524531834] [2023-12-20 00:25:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:25:36,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:25:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:25:36,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:25:36,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 00:25:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:25:37,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-20 00:25:37,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:25:37,565 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 [2023-12-20 00:25:37,570 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 [2023-12-20 00:25:37,576 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 [2023-12-20 00:25:37,802 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 25 treesize of output 17 [2023-12-20 00:25:37,808 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 23 treesize of output 15 [2023-12-20 00:25:37,876 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 28 treesize of output 16 [2023-12-20 00:25:37,880 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 19 treesize of output 11 [2023-12-20 00:25:37,883 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 31 treesize of output 15 [2023-12-20 00:25:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:25:37,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:26:01,005 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1) (* .cse1 .cse2) (* 18446744073709551615 .cse2) 1) 18446744073709551616))) (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0))) is different from true [2023-12-20 00:26:13,150 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse2 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|))) (or (= (mod (+ (* .cse0 .cse0 .cse1) .cse0 (* 18446744073709551615 .cse0 .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* 18446744073709551615 .cse1) 1) 18446744073709551616) 0)))) is different from true [2023-12-20 00:26:25,209 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#y~0#1.base|) |c_ULTIMATE.start_main_~#y~0#1.offset|)) (.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (or (not (= (mod (+ (* .cse0 .cse1) (* .cse0 18446744073709551615) (* 18446744073709551615 .cse2 .cse1) 1) 18446744073709551616) 0)) (= (mod (+ (* .cse0 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1) (* .cse0 .cse1 .cse1) .cse1) 18446744073709551616) 0))) is different from true [2023-12-20 00:26:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-20 00:26:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:26:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650897321] [2023-12-20 00:26:25,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 00:26:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524531834] [2023-12-20 00:26:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524531834] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:26:25,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 00:26:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-20 00:26:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735514163] [2023-12-20 00:26:25,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 00:26:25,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-20 00:26:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:26:25,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-20 00:26:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=432, Unknown=5, NotChecked=132, Total=650 [2023-12-20 00:26:25,213 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 00:26:34,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:26:38,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:11,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:15,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:42,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:46,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:50,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:54,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:27:58,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:02,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:06,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:10,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:14,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:18,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:22,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:26,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:30,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:34,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:38,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:42,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:28:46,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 00:28:50,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 00:28:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:28:50,855 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-12-20 00:28:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 00:28:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-20 00:28:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:28:50,858 INFO L225 Difference]: With dead ends: 63 [2023-12-20 00:28:50,858 INFO L226 Difference]: Without dead ends: 59 [2023-12-20 00:28:50,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=12, NotChecked=204, Total=1406 [2023-12-20 00:28:50,859 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 19 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 89.9s IncrementalHoareTripleChecker+Time [2023-12-20 00:28:50,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 136 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 286 Invalid, 22 Unknown, 201 Unchecked, 89.9s Time] [2023-12-20 00:28:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-20 00:28:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-12-20 00:28:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-20 00:28:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-12-20 00:28:50,869 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 18 [2023-12-20 00:28:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:28:50,869 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-12-20 00:28:50,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 00:28:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-12-20 00:28:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-20 00:28:50,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:28:50,870 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:28:50,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 00:28:51,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-20 00:28:51,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:28:51,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:28:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1152056984, now seen corresponding path program 1 times [2023-12-20 00:28:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:28:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787263246] [2023-12-20 00:28:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:28:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:28:51,117 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 00:28:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023526787] [2023-12-20 00:28:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:28:51,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:28:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:28:51,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:28:51,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 00:28:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:28:51,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-20 00:28:51,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:28:51,231 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 [2023-12-20 00:28:51,235 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 [2023-12-20 00:28:51,237 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 [2023-12-20 00:28:51,290 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 [2023-12-20 00:28:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:28:51,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:28:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:28:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787263246] [2023-12-20 00:28:51,313 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 00:28:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023526787] [2023-12-20 00:28:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023526787] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:28:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:28:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:28:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890634503] [2023-12-20 00:28:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:28:51,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:28:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:28:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:28:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:28:51,314 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 00:28:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:28:51,426 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-12-20 00:28:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 00:28:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-20 00:28:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:28:51,427 INFO L225 Difference]: With dead ends: 61 [2023-12-20 00:28:51,427 INFO L226 Difference]: Without dead ends: 53 [2023-12-20 00:28:51,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:28:51,428 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:28:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:28:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-20 00:28:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-20 00:28:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-20 00:28:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-12-20 00:28:51,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2023-12-20 00:28:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:28:51,436 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-12-20 00:28:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 00:28:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-12-20 00:28:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-20 00:28:51,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:28:51,437 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:28:51,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 00:28:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:28:51,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:28:51,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:28:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1747688822, now seen corresponding path program 1 times [2023-12-20 00:28:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:28:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672164655] [2023-12-20 00:28:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:28:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:28:51,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 00:28:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705136992] [2023-12-20 00:28:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:28:51,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:28:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:28:51,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:28:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 00:28:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:28:51,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 100 conjunts are in the unsatisfiable core [2023-12-20 00:28:51,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:28:51,836 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 [2023-12-20 00:28:51,953 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 21 treesize of output 13 [2023-12-20 00:28:51,965 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 23 treesize of output 15 [2023-12-20 00:28:52,000 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 13 treesize of output 9 [2023-12-20 00:28:52,003 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 11 [2023-12-20 00:28:54,145 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 79 treesize of output 55 [2023-12-20 00:28:54,160 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 54 treesize of output 34 [2023-12-20 00:28:54,167 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 39 treesize of output 27 [2023-12-20 00:28:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:28:54,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:29:20,308 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-20 00:29:33,142 WARN L293 SmtUtils]: Spent 12.83s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-20 00:29:48,405 WARN L293 SmtUtils]: Spent 15.26s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-20 00:29:54,563 WARN L854 $PredicateComparison]: unable to prove that (and (or (= (mod (let ((.cse1 (select (select |c_old(#memory_int#2)| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|)) (.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|))) (+ (* 18446744073709551615 .cse0 (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (* .cse1 18446744073709551615) (* .cse1 .cse0) 1)) 18446744073709551616) 0) (forall ((|v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4| Int)) (= 0 (mod (let ((.cse2 (select (select |c_#memory_int#2| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|)) (.cse3 (select (select |c_#memory_int#4| |v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4|))) (+ (* 18446744073709551615 .cse2) (* .cse3 .cse2) (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|) 18446744073709551615 .cse3) 1)) 18446744073709551616)))) (forall ((|v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4| Int)) (let ((.cse5 (select (select |c_#memory_int#4| |v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4|))) (or (= 0 (mod (let ((.cse4 (select (select |c_#memory_int#2| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|))) (+ (* 18446744073709551615 .cse4) (* .cse5 .cse4) (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|) 18446744073709551615 .cse5) 1)) 18446744073709551616)) (not (= (mod (let ((.cse6 (select (select |c_old(#memory_int#2)| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|))) (+ (* 18446744073709551615 .cse5 (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|)) (* .cse5 .cse6) (* 18446744073709551615 .cse6) 1)) 18446744073709551616) 0)))))) is different from false [2023-12-20 00:30:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:30:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672164655] [2023-12-20 00:30:03,759 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 00:30:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705136992] [2023-12-20 00:30:03,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705136992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:30:03,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:30:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2023-12-20 00:30:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465082776] [2023-12-20 00:30:03,760 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-20 00:30:03,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-20 00:30:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:30:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-20 00:30:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=399, Unknown=5, NotChecked=40, Total=506 [2023-12-20 00:30:03,761 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 00:30:12,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:30:16,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:30:18,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:30:56,985 WARN L293 SmtUtils]: Spent 27.27s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 00:31:00,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:05,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:09,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:13,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:17,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:20,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:31:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:31:21,222 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2023-12-20 00:31:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 00:31:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2023-12-20 00:31:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:31:21,224 INFO L225 Difference]: With dead ends: 63 [2023-12-20 00:31:21,224 INFO L226 Difference]: Without dead ends: 51 [2023-12-20 00:31:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=131, Invalid=797, Unknown=6, NotChecked=58, Total=992 [2023-12-20 00:31:21,225 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 12 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:31:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 35.2s Time] [2023-12-20 00:31:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-20 00:31:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-20 00:31:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 states have internal predecessors, (36), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-20 00:31:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-12-20 00:31:21,234 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 30 [2023-12-20 00:31:21,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:31:21,234 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-12-20 00:31:21,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 00:31:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-12-20 00:31:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-20 00:31:21,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:31:21,235 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2023-12-20 00:31:21,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 00:31:21,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:31:21,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:31:21,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:31:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -834140740, now seen corresponding path program 2 times [2023-12-20 00:31:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:31:21,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274655789] [2023-12-20 00:31:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:31:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:31:21,465 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 00:31:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135840964] [2023-12-20 00:31:21,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 00:31:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:31:21,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:31:21,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:31:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 00:31:25,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 00:31:25,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 00:31:25,185 WARN L260 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 273 conjunts are in the unsatisfiable core [2023-12-20 00:31:25,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:31:25,221 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 [2023-12-20 00:31:25,226 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 [2023-12-20 00:31:25,235 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 [2023-12-20 00:31:25,238 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 [2023-12-20 00:31:25,247 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 [2023-12-20 00:31:25,638 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 23 treesize of output 15 [2023-12-20 00:31:25,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-20 00:31:25,650 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 25 treesize of output 17 [2023-12-20 00:31:26,149 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 7 treesize of output 3 [2023-12-20 00:31:26,152 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 33 treesize of output 21 [2023-12-20 00:31:26,158 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 37 treesize of output 25 [2023-12-20 00:31:26,794 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 48 treesize of output 36 [2023-12-20 00:31:26,803 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 39 treesize of output 27 [2023-12-20 00:31:26,966 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 55 treesize of output 43 [2023-12-20 00:31:26,971 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 30 treesize of output 22 [2023-12-20 00:31:26,974 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 85 treesize of output 33 [2023-12-20 00:31:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:31:27,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:31:54,218 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:32:02,207 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1) (* .cse1 .cse2) (* 18446744073709551615 .cse2) 1) 18446744073709551616))) (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0))) is different from true [2023-12-20 00:32:14,398 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse2 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|))) (or (= (mod (+ (* .cse0 .cse0 .cse1) .cse0 (* 18446744073709551615 .cse0 .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* 18446744073709551615 .cse1) 1) 18446744073709551616) 0)))) is different from true [2023-12-20 00:32:34,808 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:32:54,949 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:33:03,897 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= (mod (+ (* 18446744073709551615 |c_func_to_recursive_line_30_to_38_0_#t~mem7| |c_func_to_recursive_line_30_to_38_0_#t~mem8|) (* |c_func_to_recursive_line_30_to_38_0_#t~mem6| 18446744073709551615) (* |c_func_to_recursive_line_30_to_38_0_#t~mem4| |c_func_to_recursive_line_30_to_38_0_#t~mem5|) 1) 18446744073709551616) 0)) (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:33:15,950 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14 Int)) (let ((.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14)) (.cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14)) (.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14))) (or (= (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse1) (* .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse1) (* 18446744073709551615 .cse2 .cse0 .cse0 .cse0)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1) (* 18446744073709551615 .cse2 .cse0 .cse0) .cse0 (* .cse0 .cse0 .cse1)) 18446744073709551616) 0)))))) is different from true [2023-12-20 00:33:36,794 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:33:42,626 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14 Int)) (let ((.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14)) (.cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14)) (.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14))) (or (= (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse1) (* .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse1) (* 18446744073709551615 .cse2 .cse0 .cse0 .cse0)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1) (* 18446744073709551615 .cse2 .cse0 .cse0) .cse0 (* .cse0 .cse0 .cse1)) 18446744073709551616) 0))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-20 00:33:54,819 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:02,826 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:06,832 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1) (* .cse1 .cse2) (* 18446744073709551615 .cse2) 1) 18446744073709551616))) (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:34:18,860 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:26,869 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:30,875 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|))) (or (not (= (mod (+ (* .cse0 .cse0 .cse1) .cse0 (* 18446744073709551615 .cse0 .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1)) 18446744073709551616) 0)) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* 18446744073709551615 .cse1) 1) 18446744073709551616) 0)) (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse0 .cse2) (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0) (* 18446744073709551615 .cse0 .cse0 .cse1)) 18446744073709551616)))) is different from true [2023-12-20 00:34:42,941 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:50,955 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:34:58,971 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:35:11,012 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:35:15,169 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1 .cse1) (* .cse1 .cse1 .cse1 .cse1 .cse2) (* 18446744073709551615 .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1)) 18446744073709551616)) (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0)) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:35:23,184 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:35:35,200 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:35:43,231 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:35:51,240 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:36:03,256 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:36:07,267 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= (mod (+ (* 18446744073709551615 |c_func_to_recursive_line_30_to_38_0_#t~mem7| |c_func_to_recursive_line_30_to_38_0_#t~mem8|) (* |c_func_to_recursive_line_30_to_38_0_#t~mem6| 18446744073709551615) (* |c_func_to_recursive_line_30_to_38_0_#t~mem4| |c_func_to_recursive_line_30_to_38_0_#t~mem5|) 1) 18446744073709551616) 0)) (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1 .cse1) (* .cse1 .cse1 .cse1 .cse1 .cse2) (* 18446744073709551615 .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1)) 18446744073709551616)) (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0)) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:36:19,307 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:36:27,486 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:36:31,696 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15 Int)) (let ((.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15)) (.cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15)) (.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15))) (or (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 .cse0) (* .cse0 .cse0 18446744073709551615 .cse1)) 18446744073709551616) 0)) (not (= 0 (mod (+ .cse0 (* .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 18446744073709551615 .cse1) (* .cse0 .cse0 .cse1)) 18446744073709551616))) (= (mod (+ (* .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 .cse0 .cse0 18446744073709551615 .cse1)) 18446744073709551616) 0))))) is different from true [2023-12-20 00:36:43,750 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:36:51,759 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:12,735 WARN L293 SmtUtils]: Spent 16.93s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:20,749 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:24,756 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15 Int)) (let ((.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15)) (.cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15)) (.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15))) (or (not (= (mod (+ (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 .cse0) (* .cse0 .cse0 18446744073709551615 .cse1)) 18446744073709551616) 0)) (not (= 0 (mod (+ .cse0 (* .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 18446744073709551615 .cse1) (* .cse0 .cse0 .cse1)) 18446744073709551616))) (= (mod (+ (* .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse0 .cse0 18446744073709551615 .cse2) (* .cse0 .cse0 .cse0 18446744073709551615 .cse1)) 18446744073709551616) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-20 00:37:32,771 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:40,788 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:52,828 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:37:56,836 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1) (* .cse1 .cse2) (* 18446744073709551615 .cse2) 1) 18446744073709551616))) (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1 .cse1) (* .cse1 .cse1 .cse1 .cse1 .cse2) (* 18446744073709551615 .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1)) 18446744073709551616)) (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1)) 18446744073709551616) 0)) (not (= (mod (+ (* 18446744073709551615 .cse1 .cse2) .cse1 (* 18446744073709551615 .cse0 .cse1 .cse1) (* .cse1 .cse1 .cse2)) 18446744073709551616) 0)))) is different from true [2023-12-20 00:38:08,864 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:38:16,872 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:38:24,884 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:38:28,890 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|)) (.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse2 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|))) (or (not (= (mod (+ (* .cse0 .cse0 .cse1) .cse0 (* 18446744073709551615 .cse0 .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1)) 18446744073709551616) 0)) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* 18446744073709551615 .cse1) 1) 18446744073709551616) 0)) (not (= 0 (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse0 .cse2) (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0) (* 18446744073709551615 .cse0 .cse0 .cse1)) 18446744073709551616))) (= (mod (+ (* .cse0 .cse0 .cse0 .cse0 .cse1) (* 18446744073709551615 .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse0) (* 18446744073709551615 .cse0 .cse0 .cse0 .cse0 .cse2)) 18446744073709551616) 0))) is different from true [2023-12-20 00:38:40,945 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:38:48,960 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:38:56,969 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 00:39:00,976 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#y~0#1.base|) |c_ULTIMATE.start_main_~#y~0#1.offset|)) (.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|)) (.cse1 (select (select |c_#memory_int#4| |c_ULTIMATE.start_main_~#z~0#1.base|) |c_ULTIMATE.start_main_~#z~0#1.offset|))) (or (not (= (mod (+ (* .cse0 18446744073709551615 .cse1 .cse1) (* .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1 .cse1) (* .cse0 .cse1 .cse1 .cse1)) 18446744073709551616) 0)) (= 0 (mod (+ (* .cse0 18446744073709551615 .cse1 .cse1 .cse1) (* .cse0 .cse1 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1 .cse1 .cse1) (* .cse1 .cse1 .cse1)) 18446744073709551616)) (not (= (mod (+ (* .cse0 .cse1) (* .cse0 18446744073709551615) (* 18446744073709551615 .cse2 .cse1) 1) 18446744073709551616) 0)) (not (= (mod (+ (* .cse0 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1) (* .cse0 .cse1 .cse1) .cse1) 18446744073709551616) 0)))) is different from true [2023-12-20 00:39:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 37 not checked. [2023-12-20 00:39:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:39:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274655789] [2023-12-20 00:39:00,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 00:39:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135840964] [2023-12-20 00:39:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135840964] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:39:00,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 00:39:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2023-12-20 00:39:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579838854] [2023-12-20 00:39:00,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 00:39:00,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-20 00:39:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:39:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-20 00:39:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1194, Unknown=17, NotChecked=1260, Total=2652 [2023-12-20 00:39:00,981 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 14 states have call predecessors, (16), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 00:39:11,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:39:16,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:39:24,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-12-20 00:39:29,728 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse4 (= c___VERIFIER_assert_~cond 0))) (and (or .cse0 (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15 Int)) (let ((.cse3 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_15)) (.cse1 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_15)) (.cse2 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_15) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_15))) (or (not (= (mod (+ (* .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 18446744073709551615 .cse3) (* .cse1 .cse1) (* .cse1 .cse1 18446744073709551615 .cse2)) 18446744073709551616) 0)) (not (= 0 (mod (+ .cse1 (* .cse1 .cse1 18446744073709551615 .cse3) (* .cse1 18446744073709551615 .cse2) (* .cse1 .cse1 .cse2)) 18446744073709551616))) (= (mod (+ (* .cse1 .cse1 .cse1) (* .cse1 .cse1 .cse1 .cse1 .cse2) (* .cse1 .cse1 .cse1 .cse1 18446744073709551615 .cse3) (* .cse1 .cse1 .cse1 18446744073709551615 .cse2)) 18446744073709551616) 0)))) .cse4) (exists ((v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_11 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_11 Int) (v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_11 Int)) (let ((.cse5 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_11) 0))) (let ((.cse6 (* .cse5 .cse5))) (and (<= .cse5 2147483647) (= .cse6 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_11) 0)) (= (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_11) 0) (+ .cse6 .cse5 1)) (<= 0 (+ .cse5 2147483648)))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14 Int)) (let ((.cse9 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_14)) (.cse7 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_14)) (.cse8 (select (select |c_#memory_int#2| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_14) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_14))) (or (= (mod (+ (* 18446744073709551615 .cse7 .cse7 .cse8) (* .cse7 .cse7) (* .cse7 .cse7 .cse7 .cse8) (* 18446744073709551615 .cse9 .cse7 .cse7 .cse7)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 .cse7 .cse8) (* 18446744073709551615 .cse9 .cse7 .cse7) .cse7 (* .cse7 .cse7 .cse8)) 18446744073709551616) 0))))) .cse4))) is different from true [2023-12-20 00:39:38,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:39:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:40:11,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 00:40:15,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] Received shutdown request... [2023-12-20 00:40:20,664 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 00:40:20,664 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 00:40:21,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 00:40:21,864 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 00:40:21,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-20 00:40:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-20 00:40:21,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 16 IntricatePredicates, 3 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 123.1s TimeCoverageRelationStatistics Valid=415, Invalid=2820, Unknown=21, NotChecked=2000, Total=5256 [2023-12-20 00:40:21,882 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 32 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 33.2s IncrementalHoareTripleChecker+Time [2023-12-20 00:40:21,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 181 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 662 Invalid, 7 Unknown, 955 Unchecked, 33.2s Time] [2023-12-20 00:40:21,883 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 00:40:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 00:40:21,883 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (51states) and FLOYD_HOARE automaton (currently 34 states, 52 states before enhancement),while executing Executor. [2023-12-20 00:40:21,886 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-12-20 00:40:21,887 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 00:40:21,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:40:21 BoogieIcfgContainer [2023-12-20 00:40:21,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 00:40:21,889 INFO L158 Benchmark]: Toolchain (without parser) took 886941.04ms. Allocated memory is still 253.8MB. Free memory was 200.8MB in the beginning and 183.1MB in the end (delta: 17.7MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-20 00:40:21,889 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:40:21,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.40ms. Allocated memory is still 253.8MB. Free memory was 200.3MB in the beginning and 189.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-20 00:40:21,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.96ms. Allocated memory is still 253.8MB. Free memory was 189.3MB in the beginning and 187.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:40:21,889 INFO L158 Benchmark]: Boogie Preprocessor took 48.19ms. Allocated memory is still 253.8MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:40:21,890 INFO L158 Benchmark]: RCFGBuilder took 343.47ms. Allocated memory is still 253.8MB. Free memory was 185.6MB in the beginning and 169.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 00:40:21,890 INFO L158 Benchmark]: TraceAbstraction took 886337.06ms. Allocated memory is still 253.8MB. Free memory was 168.9MB in the beginning and 183.1MB in the end (delta: -14.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:40:21,890 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.11ms. Allocated memory is still 174.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.40ms. Allocated memory is still 253.8MB. Free memory was 200.3MB in the beginning and 189.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.96ms. Allocated memory is still 253.8MB. Free memory was 189.3MB in the beginning and 187.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.19ms. Allocated memory is still 253.8MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.47ms. Allocated memory is still 253.8MB. Free memory was 185.6MB in the beginning and 169.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 886337.06ms. Allocated memory is still 253.8MB. Free memory was 168.9MB in the beginning and 183.1MB in the end (delta: -14.2MB). There was no memory consumed. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 41). Cancelled while NwaCegarLoop was constructing difference of abstraction (51states) and FLOYD_HOARE automaton (currently 34 states, 52 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 304.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 158.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 493 SdHoareTripleChecker+Invalid, 158.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1156 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 61 mSDtfsCounter, 1302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 67 SyntacticMatches, 18 SemanticMatches, 155 ConstructedPredicates, 20 IntricatePredicates, 3 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 273.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 575.7s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 161 ConstructedInterpolants, 33 QuantifiedInterpolants, 8536 SizeOfPredicates, 186 NumberOfNonLiveVariables, 1274 ConjunctsInSsa, 574 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 17/117 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown