/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:29:17,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:29:17,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:29:17,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:29:17,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:29:17,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:29:17,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:29:17,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:29:17,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:29:17,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:29:17,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:29:17,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:29:17,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:29:17,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:29:17,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:29:17,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:29:17,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:29:17,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:29:17,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:29:17,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:29:17,070 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:29:17,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:29:17,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:29:17,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:29:17,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:29:17,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:29:17,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:29:17,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:29:17,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:29:17,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:29:17,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:29:17,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:29:17,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:29:17,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:29:17,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:29:17,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:29:17,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:29:17,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:29:17,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:29:17,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:29:17,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:29:17,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:29:17,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:29:17,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:29:17,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:29:17,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:29:17,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:29:17,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:29:17,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:29:17,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:29:17,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:29:17,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:29:17,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:29:17,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:29:17,099 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:29:17,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:29:17,100 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:29:17,100 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:29:17,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:29:17,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:29:17,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:29:17,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:29:17,312 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:29:17,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-28 10:29:17,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d906578/cc54f03619284269906318cbcaaa20b3/FLAG4750f2671 [2022-04-28 10:29:17,726 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:29:17,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2022-04-28 10:29:17,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d906578/cc54f03619284269906318cbcaaa20b3/FLAG4750f2671 [2022-04-28 10:29:17,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d906578/cc54f03619284269906318cbcaaa20b3 [2022-04-28 10:29:17,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:29:17,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:29:17,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:29:17,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:29:17,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:29:17,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6834e4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17, skipping insertion in model container [2022-04-28 10:29:17,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:29:17,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:29:17,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c[403,416] [2022-04-28 10:29:17,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:29:17,950 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:29:17,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c[403,416] [2022-04-28 10:29:17,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:29:17,970 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:29:17,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17 WrapperNode [2022-04-28 10:29:17,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:29:17,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:29:17,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:29:17,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:29:17,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:17,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:29:17,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:29:17,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:29:17,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:29:17,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (1/1) ... [2022-04-28 10:29:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:29:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:18,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:29:18,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:29:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:29:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:29:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:29:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:29:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:29:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:29:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:29:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:29:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:29:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:29:18,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:29:18,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:29:26,941 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:29:26,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:29:26,946 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:29:26,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:29:26 BoogieIcfgContainer [2022-04-28 10:29:26,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:29:26,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:29:26,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:29:26,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:29:26,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:29:17" (1/3) ... [2022-04-28 10:29:26,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc5bb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:29:26, skipping insertion in model container [2022-04-28 10:29:26,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:29:17" (2/3) ... [2022-04-28 10:29:26,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc5bb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:29:26, skipping insertion in model container [2022-04-28 10:29:26,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:29:26" (3/3) ... [2022-04-28 10:29:26,954 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2022-04-28 10:29:26,965 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:29:26,965 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:29:26,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:29:27,004 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49f54e8a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cbabde6 [2022-04-28 10:29:27,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:29:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:29:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:29:27,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:27,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:27,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 1 times [2022-04-28 10:29:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892052170] [2022-04-28 10:29:27,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:29:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1128394070, now seen corresponding path program 2 times [2022-04-28 10:29:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:27,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846525295] [2022-04-28 10:29:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:27,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-28 10:29:27,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:29:27,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-28 10:29:27,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:27,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {31#true} is VALID [2022-04-28 10:29:27,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:29:27,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #86#return; {31#true} is VALID [2022-04-28 10:29:27,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 10:29:27,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:27,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:27,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:27,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} is VALID [2022-04-28 10:29:27,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (<= 1 main_~v5~0) (= main_~v3~0 0) (<= main_~v5~0 1))} ~l~0 := 1 + ~l~0; {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:27,676 INFO L272 TraceCheckUtils]: 10: Hoare triple {38#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296)))) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (div main_~l~0 4294967296)) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:29:27,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:29:27,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32#false} is VALID [2022-04-28 10:29:27,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 10:29:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:27,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846525295] [2022-04-28 10:29:27,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846525295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:27,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:27,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:29:27,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:27,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892052170] [2022-04-28 10:29:27,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892052170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:27,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:27,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:29:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914228217] [2022-04-28 10:29:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:29:27,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:27,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:27,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:29:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:29:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:29:27,721 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:30,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:34,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:38,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:45,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:47,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:51,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:56,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:58,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:02,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:02,986 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-28 10:30:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:30:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:30:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 10:30:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 10:30:02,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 10:30:03,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:03,103 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:30:03,103 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:30:03,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:30:03,106 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:03,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 19.0s Time] [2022-04-28 10:30:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:30:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-28 10:30:03,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:03,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:03,145 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:03,146 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:03,156 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 10:30:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 10:30:03,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:03,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:03,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-28 10:30:03,159 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-28 10:30:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:03,161 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 10:30:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 10:30:03,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:03,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:03,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:03,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-28 10:30:03,164 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2022-04-28 10:30:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:03,165 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-28 10:30:03,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:03,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-28 10:30:03,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 10:30:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:30:03,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:03,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:03,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:30:03,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 1 times [2022-04-28 10:30:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712118305] [2022-04-28 10:30:04,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:04,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1294727378, now seen corresponding path program 2 times [2022-04-28 10:30:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558161048] [2022-04-28 10:30:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:04,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-28 10:30:04,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:04,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-28 10:30:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 10:30:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:04,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-28 10:30:04,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-28 10:30:04,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:04,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:04,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:04,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-28 10:30:04,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:04,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-28 10:30:04,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-28 10:30:04,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {323#(= main_~l~0 0)} is VALID [2022-04-28 10:30:04,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {323#(= main_~l~0 0)} is VALID [2022-04-28 10:30:04,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {323#(= main_~l~0 0)} is VALID [2022-04-28 10:30:04,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {323#(= main_~l~0 0)} is VALID [2022-04-28 10:30:04,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:04,552 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-28 10:30:04,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-28 10:30:04,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-28 10:30:04,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:04,553 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #84#return; {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:04,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:04,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {319#false} is VALID [2022-04-28 10:30:04,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {319#false} ~l~0 := 1 + ~l~0; {319#false} is VALID [2022-04-28 10:30:04,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {319#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {319#false} is VALID [2022-04-28 10:30:04,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2022-04-28 10:30:04,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {319#false} assume 0 == ~cond; {319#false} is VALID [2022-04-28 10:30:04,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-28 10:30:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:04,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558161048] [2022-04-28 10:30:04,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558161048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57832823] [2022-04-28 10:30:04,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:04,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:04,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:04,557 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) [2022-04-28 10:30:04,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:30:04,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:04,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:04,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:30:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:04,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:05,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2022-04-28 10:30:05,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-28 10:30:05,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:05,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-28 10:30:05,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-28 10:30:05,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {358#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {358#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,195 INFO L272 TraceCheckUtils]: 10: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-28 10:30:05,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-28 10:30:05,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-28 10:30:05,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:05,198 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #84#return; {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#(and (= (+ (- 1) main_~v5~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {384#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {384#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {388#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:05,201 INFO L272 TraceCheckUtils]: 18: Hoare triple {388#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v5~0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:05,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:05,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {319#false} is VALID [2022-04-28 10:30:05,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-28 10:30:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:05,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {319#false} assume !false; {319#false} is VALID [2022-04-28 10:30:05,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {319#false} is VALID [2022-04-28 10:30:05,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:05,479 INFO L272 TraceCheckUtils]: 18: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:05,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:30:05,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,549 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {318#true} {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} #84#return; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:05,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#true} assume !(0 == ~cond); {318#true} is VALID [2022-04-28 10:30:05,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#true} ~cond := #in~cond; {318#true} is VALID [2022-04-28 10:30:05,550 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {318#true} is VALID [2022-04-28 10:30:05,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {416#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:30:05,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {412#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v5~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:05,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret5 := main(); {318#true} is VALID [2022-04-28 10:30:05,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #86#return; {318#true} is VALID [2022-04-28 10:30:05,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2022-04-28 10:30:05,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {318#true} is VALID [2022-04-28 10:30:05,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2022-04-28 10:30:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:30:05,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57832823] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:05,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:05,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-28 10:30:05,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:05,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712118305] [2022-04-28 10:30:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712118305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:05,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521706076] [2022-04-28 10:30:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:05,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:30:05,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:05,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:30:05,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:05,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:30:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:30:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:30:05,616 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:30:07,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:09,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:12,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:18,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:20,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:31,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:33,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:42,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:44,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:48,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:48,796 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 10:30:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:30:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:30:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 10:30:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:30:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 10:30:48,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-28 10:30:48,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:48,865 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:30:48,865 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:30:48,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:30:48,866 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:48,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 20.8s Time] [2022-04-28 10:30:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:30:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-04-28 10:30:48,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:48,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:48,905 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:48,905 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:48,907 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 10:30:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 10:30:48,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:48,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:48,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-28 10:30:48,908 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-28 10:30:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:48,910 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 10:30:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 10:30:48,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:48,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:48,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:48,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:30:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-28 10:30:48,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 22 [2022-04-28 10:30:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:48,912 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-28 10:30:48,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:30:48,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions. [2022-04-28 10:30:49,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-28 10:30:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:30:49,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:49,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:49,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:30:49,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:49,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1889278409, now seen corresponding path program 1 times [2022-04-28 10:30:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:49,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865817184] [2022-04-28 10:30:50,305 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:50,305 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1889278409, now seen corresponding path program 2 times [2022-04-28 10:30:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623612673] [2022-04-28 10:30:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:50,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {713#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {702#true} is VALID [2022-04-28 10:30:50,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 10:30:50,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2022-04-28 10:30:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 10:30:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:50,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2022-04-28 10:30:50,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2022-04-28 10:30:50,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 10:30:50,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:50,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {713#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:50,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {702#true} is VALID [2022-04-28 10:30:50,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 10:30:50,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2022-04-28 10:30:50,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret5 := main(); {702#true} is VALID [2022-04-28 10:30:50,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {707#(= main_~l~0 0)} is VALID [2022-04-28 10:30:50,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {707#(= main_~l~0 0)} is VALID [2022-04-28 10:30:50,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {707#(= main_~l~0 0)} is VALID [2022-04-28 10:30:50,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {707#(= main_~l~0 0)} is VALID [2022-04-28 10:30:50,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:50,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {702#true} is VALID [2022-04-28 10:30:50,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2022-04-28 10:30:50,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#true} assume !(0 == ~cond); {702#true} is VALID [2022-04-28 10:30:50,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 10:30:50,446 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {702#true} {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #84#return; {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:50,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:50,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:30:50,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {708#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {703#false} is VALID [2022-04-28 10:30:50,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {703#false} ~l~0 := 1 + ~l~0; {703#false} is VALID [2022-04-28 10:30:50,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {703#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {703#false} is VALID [2022-04-28 10:30:50,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2022-04-28 10:30:50,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2022-04-28 10:30:50,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-04-28 10:30:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623612673] [2022-04-28 10:30:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623612673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262030877] [2022-04-28 10:30:50,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:50,452 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) [2022-04-28 10:30:50,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process