/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/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:28:39,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:28:39,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:28:39,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:28:39,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:28:39,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:28:39,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:28:39,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:28:39,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:28:39,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:28:39,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:28:39,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:28:39,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:28:39,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:28:39,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:28:39,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:28:39,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:28:39,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:28:39,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:28:39,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:28:39,741 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:28:39,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:28:39,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:28:39,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:28:39,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:28:39,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:28:39,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:28:39,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:28:39,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:28:39,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:28:39,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:28:39,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:28:39,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:28:39,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:28:39,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:28:39,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:28:39,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:28:39,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:28:39,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:28:39,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:28:39,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:28:39,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:28:39,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:28:39,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:28:39,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:28:39,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:28:39,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:28:39,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:28:39,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:28:39,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:28:39,772 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:28:39,773 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-08 10:28:40,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:28:40,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:28:40,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:28:40,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:28:40,091 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:28:40,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-08 10:28:40,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164caeaed/042c1f5eb6024242963b83a7d1850a11/FLAGb2b1ee39d [2022-04-08 10:28:40,499 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:28:40,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-08 10:28:40,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164caeaed/042c1f5eb6024242963b83a7d1850a11/FLAGb2b1ee39d [2022-04-08 10:28:40,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164caeaed/042c1f5eb6024242963b83a7d1850a11 [2022-04-08 10:28:40,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:28:40,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:28:40,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:28:40,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:28:40,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:28:40,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:28:40" (1/1) ... [2022-04-08 10:28:40,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1a7507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:40, skipping insertion in model container [2022-04-08 10:28:40,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:28:40" (1/1) ... [2022-04-08 10:28:40,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:28:40,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:28:41,143 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/sumt9.c[403,416] [2022-04-08 10:28:41,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:28:41,212 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:28:41,219 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/sumt9.c[403,416] [2022-04-08 10:28:41,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:28:41,234 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:28:41,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41 WrapperNode [2022-04-08 10:28:41,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:28:41,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:28:41,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:28:41,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:28:41,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:28:41,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:28:41,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:28:41,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:28:41,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (1/1) ... [2022-04-08 10:28:41,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:28:41,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:28:41,308 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-08 10:28:41,319 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-08 10:28:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:28:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:28:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:28:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:28:41,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:28:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:28:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:28:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:28:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:28:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:28:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:28:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:28:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:28:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:28:41,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:28:41,384 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:28:41,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:28:52,426 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:28:52,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:28:52,431 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:28:52,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:28:52 BoogieIcfgContainer [2022-04-08 10:28:52,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:28:52,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:28:52,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:28:52,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:28:52,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:28:40" (1/3) ... [2022-04-08 10:28:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a6875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:28:52, skipping insertion in model container [2022-04-08 10:28:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:28:41" (2/3) ... [2022-04-08 10:28:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a6875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:28:52, skipping insertion in model container [2022-04-08 10:28:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:28:52" (3/3) ... [2022-04-08 10:28:52,442 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2022-04-08 10:28:52,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:28:52,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:28:52,470 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:28:52,474 INFO L340 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 [2022-04-08 10:28:52,474 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:28:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 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-08 10:28:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:28:52,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:28:52,489 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:28:52,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:28:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:28:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 1 times [2022-04-08 10:28:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:52,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [644419694] [2022-04-08 10:28:52,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:28:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 2 times [2022-04-08 10:28:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:28:52,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149793060] [2022-04-08 10:28:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:28:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:28:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:28:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:53,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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; {32#true} is VALID [2022-04-08 10:28:53,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:28:53,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-08 10:28:53,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:28:53,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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; {32#true} is VALID [2022-04-08 10:28:53,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:28:53,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-08 10:28:53,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 10:28:53,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:53,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:53,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:53,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#(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_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:53,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 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_~v6~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_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~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_~v6~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_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:53,086 INFO L272 TraceCheckUtils]: 10: Hoare triple {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 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_~v6~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_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~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_~v6~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_~v6~0 main_~v5~0 main_~v4~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 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:28:53,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:28:53,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-08 10:28:53,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 10:28:53,088 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-08 10:28:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:28:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149793060] [2022-04-08 10:28:53,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149793060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:28:53,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:28:53,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:28:53,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:28:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [644419694] [2022-04-08 10:28:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [644419694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:28:53,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:28:53,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:28:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676492526] [2022-04-08 10:28:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:28:53,133 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-08 10:28:53,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:28:53,136 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-08 10:28:53,154 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-08 10:28:53,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:28:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:28:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:28:53,174 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 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-08 10:28:55,453 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-08 10:29:00,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:02,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:04,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:06,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:10,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:13,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:15,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:17,475 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-08 10:29:21,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:24,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:26,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:32,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:35,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:37,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:39,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,728 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-08 10:29:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:29:39,729 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-08 10:29:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:39,730 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-08 10:29:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 10:29:39,736 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-08 10:29:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 10:29:39,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 10:29:39,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:39,874 INFO L225 Difference]: With dead ends: 67 [2022-04-08 10:29:39,874 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:29:39,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:29:39,879 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:39,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 16 Unknown, 0 Unchecked, 33.9s Time] [2022-04-08 10:29:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:29:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 10:29:39,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:39,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:29:39,917 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:29:39,917 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:29:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,929 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 10:29:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-08 10:29:39,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:39,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:39,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 10:29:39,932 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-08 10:29:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:39,934 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 10:29:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-08 10:29:39,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:39,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:39,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:39,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) 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), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:29:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 10:29:39,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 10:29:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:39,937 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 10:29:39,938 INFO L479 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-08 10:29:39,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 10:29:39,983 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-08 10:29:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:29:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:29:39,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:39,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:39,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:29:39,984 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 1 times [2022-04-08 10:29:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:39,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281241331] [2022-04-08 10:29:39,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:29:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 2 times [2022-04-08 10:29:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:39,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081245846] [2022-04-08 10:29:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:29:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:40,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#(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; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:40,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:40,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {323#true} #91#return; {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:40,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:29:40,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(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; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:40,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:40,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {323#true} #91#return; {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:40,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:40,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~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;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {329#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:40,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {330#(= main_~l~0 0)} is VALID [2022-04-08 10:29:40,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {330#(= main_~l~0 0)} is VALID [2022-04-08 10:29:40,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {330#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {324#false} is VALID [2022-04-08 10:29:40,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#false} 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; {324#false} is VALID [2022-04-08 10:29:40,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#false} ~l~0 := 1 + ~l~0; {324#false} is VALID [2022-04-08 10:29:40,273 INFO L272 TraceCheckUtils]: 11: Hoare triple {324#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {324#false} is VALID [2022-04-08 10:29:40,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 10:29:40,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 10:29:40,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 10:29:40,273 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-08 10:29:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081245846] [2022-04-08 10:29:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081245846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:29:40,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281241331] [2022-04-08 10:29:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281241331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:29:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479706648] [2022-04-08 10:29:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:40,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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 15 [2022-04-08 10:29:40,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:40,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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-08 10:29:42,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:42,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:29:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:29:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:29:42,468 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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-08 10:29:46,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:49,033 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-08 10:29:55,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:57,692 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-08 10:29:59,899 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-08 10:30:04,202 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-08 10:30:08,578 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-08 10:30:12,935 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-08 10:30:17,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:30:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:17,509 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-08 10:30:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:30:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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 15 [2022-04-08 10:30:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:30:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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-08 10:30:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-08 10:30:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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-08 10:30:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-08 10:30:17,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-04-08 10:30:19,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:19,772 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:30:19,772 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:30:19,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:30:19,773 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:30:19,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 18.2s Time] [2022-04-08 10:30:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:30:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 10:30:19,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:30:19,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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-08 10:30:19,825 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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-08 10:30:19,825 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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-08 10:30:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:19,827 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 10:30:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 10:30:19,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:19,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:19,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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 32 states. [2022-04-08 10:30:19,828 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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 32 states. [2022-04-08 10:30:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:30:19,829 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 10:30:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 10:30:19,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:30:19,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:30:19,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:30:19,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:30:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 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-08 10:30:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-08 10:30:19,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-04-08 10:30:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:30:19,831 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-08 10:30:19,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 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-08 10:30:19,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 40 transitions. [2022-04-08 10:30:19,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:30:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-08 10:30:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:30:19,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:30:19,878 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:30:19,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:30:19,879 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:30:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:30:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash -133245550, now seen corresponding path program 1 times [2022-04-08 10:30:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:30:19,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591457553] [2022-04-08 10:30:22,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:30:22,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:30:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash -133245550, now seen corresponding path program 2 times [2022-04-08 10:30:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:30:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536290062] [2022-04-08 10:30:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:30:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:30:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:30:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:22,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {576#(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; {565#true} is VALID [2022-04-08 10:30:22,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 10:30:22,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-08 10:30:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 10:30:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:30:22,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-08 10:30:22,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-08 10:30:22,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 10:30:22,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} #89#return; {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-08 10:30:22,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {576#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:30:22,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#(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; {565#true} is VALID [2022-04-08 10:30:22,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 10:30:22,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #91#return; {565#true} is VALID [2022-04-08 10:30:22,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret5 := main(); {565#true} is VALID [2022-04-08 10:30:22,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#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;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {570#(= main_~l~0 0)} is VALID [2022-04-08 10:30:22,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {570#(= main_~l~0 0)} is VALID [2022-04-08 10:30:22,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {570#(= main_~l~0 0)} is VALID [2022-04-08 10:30:22,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {570#(= main_~l~0 0)} is VALID [2022-04-08 10:30:22,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-08 10:30:22,330 INFO L272 TraceCheckUtils]: 10: Hoare triple {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {565#true} is VALID [2022-04-08 10:30:22,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-08 10:30:22,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-08 10:30:22,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-08 10:30:22,331 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {565#true} {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} #89#return; {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-08 10:30:22,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-08 10:30:22,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {566#false} is VALID [2022-04-08 10:30:22,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {566#false} ~l~0 := 1 + ~l~0; {566#false} is VALID [2022-04-08 10:30:22,333 INFO L272 TraceCheckUtils]: 18: Hoare triple {566#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {566#false} is VALID [2022-04-08 10:30:22,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {566#false} ~cond := #in~cond; {566#false} is VALID [2022-04-08 10:30:22,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#false} assume 0 == ~cond; {566#false} is VALID [2022-04-08 10:30:22,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-08 10:30:22,334 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-08 10:30:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:30:22,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536290062] [2022-04-08 10:30:22,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536290062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:30:22,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975542964] [2022-04-08 10:30:22,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:30:22,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:30:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:30:22,336 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-08 10:30:22,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process