/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:52:57,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:52:57,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:52:57,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:52:57,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:52:57,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:52:57,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:52:57,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:52:57,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:52:57,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:52:57,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:52:57,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:52:57,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:52:57,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:52:57,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:52:57,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:52:57,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:52:57,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:52:57,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:52:57,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:52:57,459 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:52:57,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:52:57,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:52:57,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:52:57,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:52:57,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:52:57,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:52:57,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:52:57,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:52:57,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:52:57,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:52:57,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:52:57,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:52:57,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:52:57,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:52:57,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:52:57,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:52:57,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:52:57,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:52:57,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:52:57,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:52:57,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:52:57,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:52:57,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:52:57,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:52:57,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:52:57,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:52:57,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:52:57,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:57,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:52:57,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:52:57,478 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:52:57,478 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:52:57,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:52:57,478 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:52:57,478 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 04:52:57,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:52:57,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:52:57,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:52:57,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:52:57,620 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:52:57,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-04-28 04:52:57,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aee8214/5f43661495e44daabde6efd5239c7763/FLAG345251c61 [2022-04-28 04:52:58,014 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:52:58,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-04-28 04:52:58,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aee8214/5f43661495e44daabde6efd5239c7763/FLAG345251c61 [2022-04-28 04:52:58,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07aee8214/5f43661495e44daabde6efd5239c7763 [2022-04-28 04:52:58,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:52:58,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:52:58,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:58,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:52:58,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:52:58,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fffd5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58, skipping insertion in model container [2022-04-28 04:52:58,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:52:58,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:52:58,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2022-04-28 04:52:58,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:58,654 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:52:58,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2022-04-28 04:52:58,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:58,682 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:52:58,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58 WrapperNode [2022-04-28 04:52:58,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:58,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:52:58,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:52:58,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:52:58,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:52:58,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:52:58,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:52:58,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:52:58,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (1/1) ... [2022-04-28 04:52:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:58,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:58,749 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 04:52:58,751 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 04:52:58,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:52:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:52:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:52:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:52:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:52:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:52:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:52:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:52:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:52:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:52:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:52:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:52:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:52:58,824 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:52:58,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:52:58,973 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:52:58,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:52:58,978 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:52:58,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:58 BoogieIcfgContainer [2022-04-28 04:52:58,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:52:58,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:52:58,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:52:58,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:52:58,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:52:58" (1/3) ... [2022-04-28 04:52:58,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117ee1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:58, skipping insertion in model container [2022-04-28 04:52:58,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:58" (2/3) ... [2022-04-28 04:52:58,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117ee1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:58, skipping insertion in model container [2022-04-28 04:52:58,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:58" (3/3) ... [2022-04-28 04:52:58,997 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2022-04-28 04:52:59,027 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:52:59,027 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:52:59,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:52:59,073 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@6c210b73, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2471c102 [2022-04-28 04:52:59,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:52:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:52:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:52:59,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:59,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:52:59,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-28 04:52:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354478472] [2022-04-28 04:52:59,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-28 04:52:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826324584] [2022-04-28 04:52:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:52:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:59,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-28 04:52:59,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:52:59,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:52:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:52:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:59,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:59,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:59,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:59,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:52:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:52:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:59,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:59,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:59,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:59,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:52:59,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:52:59,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-28 04:52:59,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 04:52:59,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-28 04:52:59,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-28 04:52:59,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-28 04:52:59,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {41#true} is VALID [2022-04-28 04:52:59,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:59,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:59,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:59,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-28 04:52:59,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-28 04:52:59,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 04:52:59,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-28 04:52:59,320 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-28 04:52:59,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 04:52:59,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 04:52:59,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 04:52:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:52:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826324584] [2022-04-28 04:52:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826324584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:59,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:59,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:59,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:59,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354478472] [2022-04-28 04:52:59,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354478472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:59,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:59,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049053320] [2022-04-28 04:52:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:59,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 04:52:59,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:59,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:52:59,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:52:59,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:52:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:52:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:52:59,409 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:53:06,435 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 04:53:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:17,226 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-28 04:53:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:53:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 04:53:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:53:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:53:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:53:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-28 04:53:17,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-28 04:53:17,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:17,373 INFO L225 Difference]: With dead ends: 69 [2022-04-28 04:53:17,374 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:53:17,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:53:17,377 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:17,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 04:53:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:53:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 04:53:17,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:17,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:53:17,398 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:53:17,399 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:53:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:17,402 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:53:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:17,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:17,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:17,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-28 04:53:17,404 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-28 04:53:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:17,407 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-28 04:53:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:17,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:17,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:17,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:17,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:53:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-28 04:53:17,411 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-28 04:53:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:17,411 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-28 04:53:17,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:53:17,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-28 04:53:17,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-28 04:53:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:53:17,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:17,456 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:17,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:53:17,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-28 04:53:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:17,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554162341] [2022-04-28 04:53:17,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-28 04:53:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:17,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868088327] [2022-04-28 04:53:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:17,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-28 04:53:17,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:53:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:17,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:17,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:17,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:53:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:17,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:17,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:17,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:53:17,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:17,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-28 04:53:17,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-28 04:53:17,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-28 04:53:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-28 04:53:17,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {327#true} is VALID [2022-04-28 04:53:17,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:17,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:17,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-28 04:53:17,636 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {327#true} is VALID [2022-04-28 04:53:17,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-28 04:53:17,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-28 04:53:17,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-28 04:53:17,636 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-28 04:53:17,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:17,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:17,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 04:53:17,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !false; {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-28 04:53:17,639 INFO L272 TraceCheckUtils]: 20: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:53:17,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:53:17,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-28 04:53:17,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-28 04:53:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:53:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868088327] [2022-04-28 04:53:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868088327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:17,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:17,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554162341] [2022-04-28 04:53:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554162341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:53:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425122627] [2022-04-28 04:53:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 04:53:17,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:17,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:17,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:17,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:53:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:53:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:53:17,659 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:22,044 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 04:53:33,700 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 04:53:35,703 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 04:53:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,782 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-28 04:53:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:53:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 04:53:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-28 04:53:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-28 04:53:35,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-28 04:53:35,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:35,900 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:53:35,900 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 04:53:35,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:53:35,901 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:35,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 57 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 200 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2022-04-28 04:53:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 04:53:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 04:53:35,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:35,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:35,915 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:35,916 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,918 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-28 04:53:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:35,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:35,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:35,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-28 04:53:35,920 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-28 04:53:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:35,922 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-28 04:53:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:35,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:35,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:35,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:35,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:53:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-28 04:53:35,925 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-28 04:53:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:35,925 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-28 04:53:35,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:35,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 65 transitions. [2022-04-28 04:53:36,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-28 04:53:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:53:36,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:36,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:36,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:53:36,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-28 04:53:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:36,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229920568] [2022-04-28 04:53:36,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-28 04:53:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:36,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124819555] [2022-04-28 04:53:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {703#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-28 04:53:36,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-28 04:53:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-28 04:53:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 04:53:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-28 04:53:36,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:36,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-28 04:53:36,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-28 04:53:36,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2022-04-28 04:53:36,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {685#true} is VALID [2022-04-28 04:53:36,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:36,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-28 04:53:36,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:36,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-28 04:53:36,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {685#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {698#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:36,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {698#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:36,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {698#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {699#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:36,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {699#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {699#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:36,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {699#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {700#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-28 04:53:36,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {700#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} assume !false; {700#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-28 04:53:36,283 INFO L272 TraceCheckUtils]: 22: Hoare triple {700#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {701#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:53:36,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {701#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {702#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:53:36,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {702#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {686#false} is VALID [2022-04-28 04:53:36,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-28 04:53:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:53:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124819555] [2022-04-28 04:53:36,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124819555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:53:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676878326] [2022-04-28 04:53:36,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:36,286 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 04:53:36,339 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 04:53:36,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:53:36,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:36,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:53:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:36,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:36,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2022-04-28 04:53:36,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#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(13, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-28 04:53:36,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-28 04:53:36,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2022-04-28 04:53:36,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {685#true} is VALID [2022-04-28 04:53:36,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:36,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,722 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-28 04:53:36,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {685#true} is VALID [2022-04-28 04:53:36,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:53:36,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:53:36,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:53:36,730 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-28 04:53:36,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {685#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:36,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:36,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:36,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:36,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {755#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {768#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 04:53:36,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {768#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} assume !false; {768#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} is VALID [2022-04-28 04:53:36,735 INFO L272 TraceCheckUtils]: 22: Hoare triple {768#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:36,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:36,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID [2022-04-28 04:53:36,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-28 04:53:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 04:53:36,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:36,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676878326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:36,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:53:36,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-04-28 04:53:36,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:36,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229920568] [2022-04-28 04:53:36,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229920568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:36,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:36,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:53:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247485672] [2022-04-28 04:53:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:36,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 04:53:36,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:36,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:36,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:36,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:53:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:53:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:53:36,756 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:53,299 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-04-28 04:53:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:53:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 04:53:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 04:53:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-04-28 04:53:53,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-04-28 04:53:53,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:53,621 INFO L225 Difference]: With dead ends: 77 [2022-04-28 04:53:53,621 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 04:53:53,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:53:53,622 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:53,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:53:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 04:53:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2022-04-28 04:53:53,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:53,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:53,651 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:53,652 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:53,655 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-28 04:53:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-28 04:53:53,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:53,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:53,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-28 04:53:53,657 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-28 04:53:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:53,660 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2022-04-28 04:53:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-04-28 04:53:53,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:53,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:53,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:53,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-28 04:53:53,674 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-28 04:53:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:53,674 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-28 04:53:53,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:53:53,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-28 04:53:53,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-28 04:53:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:53:53,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:53,941 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:53:53,958 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 04:53:54,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:54,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-28 04:53:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:54,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310840941] [2022-04-28 04:53:54,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:53:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-28 04:53:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:54,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169867397] [2022-04-28 04:53:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:54,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:54,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269147573] [2022-04-28 04:53:54,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:54,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:54,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:54,163 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 04:53:54,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:53:54,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:53:54,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:54,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:53:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:54,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:54,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 04:53:54,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(13, 2);call #Ultimate.allocInit(12, 3); {1211#true} is VALID [2022-04-28 04:53:54,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #103#return; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret5 := main(); {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {1211#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1211#true} {1211#true} #81#return; {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L272 TraceCheckUtils]: 11: Hoare triple {1211#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1211#true} is VALID [2022-04-28 04:53:54,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 04:53:54,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 04:53:54,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 04:53:54,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1211#true} {1211#true} #83#return; {1211#true} is VALID [2022-04-28 04:53:54,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,422 INFO L272 TraceCheckUtils]: 20: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1211#true} is VALID [2022-04-28 04:53:54,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 04:53:54,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 04:53:54,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 04:53:54,423 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1211#true} {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,423 INFO L272 TraceCheckUtils]: 25: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1211#true} is VALID [2022-04-28 04:53:54,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 04:53:54,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 04:53:54,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 04:53:54,424 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1211#true} {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-28 04:53:54,425 INFO L272 TraceCheckUtils]: 30: Hoare triple {1264#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1307#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:54,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1311#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:54,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {1311#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 04:53:54,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 04:53:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 04:53:54,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169867397] [2022-04-28 04:53:54,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269147573] [2022-04-28 04:53:54,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269147573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:54,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:54,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:54,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:54,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310840941] [2022-04-28 04:53:54,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310840941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:54,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:54,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291040708] [2022-04-28 04:53:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 04:53:54,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:54,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:54,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:54,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:54,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:53:54,451 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:53:59,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:54:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:02,433 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-28 04:54:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:54:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 04:54:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:54:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 04:54:02,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 04:54:02,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:02,502 INFO L225 Difference]: With dead ends: 74 [2022-04-28 04:54:02,503 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:54:02,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:54:02,504 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:02,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 04:54:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:54:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 04:54:02,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:02,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:54:02,530 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:54:02,530 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:54:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:02,532 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:54:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:02,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:02,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:02,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 04:54:02,533 INFO L87 Difference]: Start difference. First operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states. [2022-04-28 04:54:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:02,535 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:54:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:02,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:02,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:02,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:02,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:54:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-28 04:54:02,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34 [2022-04-28 04:54:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:02,537 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-28 04:54:02,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:02,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-28 04:54:02,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:54:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:54:02,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:02,766 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:54:02,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:54:02,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:54:02,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-28 04:54:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:02,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083195951] [2022-04-28 04:54:02,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:54:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-28 04:54:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:02,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774206945] [2022-04-28 04:54:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:02,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:02,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967456421] [2022-04-28 04:54:02,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:02,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:54:03,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:54:03,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:54:03,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:54:03,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:54:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:54:03,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:54:03,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-28 04:54:03,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#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(13, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-28 04:54:03,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 04:54:03,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #103#return; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret5 := main(); {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {1671#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 2 then 1 else 0)); {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#true} ~cond := #in~cond; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 == ~cond); {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1671#true} {1671#true} #81#return; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {1671#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#true} ~cond := #in~cond; {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#true} assume !(0 == ~cond); {1671#true} is VALID [2022-04-28 04:54:03,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 04:54:03,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1671#true} {1671#true} #83#return; {1671#true} is VALID [2022-04-28 04:54:03,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1671#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,216 INFO L272 TraceCheckUtils]: 22: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1671#true} is VALID [2022-04-28 04:54:03,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {1671#true} ~cond := #in~cond; {1671#true} is VALID [2022-04-28 04:54:03,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#true} assume !(0 == ~cond); {1671#true} is VALID [2022-04-28 04:54:03,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 04:54:03,227 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1671#true} {1724#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1671#true} is VALID [2022-04-28 04:54:03,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#true} ~cond := #in~cond; {1671#true} is VALID [2022-04-28 04:54:03,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1671#true} assume !(0 == ~cond); {1671#true} is VALID [2022-04-28 04:54:03,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 04:54:03,233 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1671#true} {1724#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1724#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:54:03,234 INFO L272 TraceCheckUtils]: 32: Hoare triple {1724#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:54:03,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {1773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:54:03,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {1777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1672#false} is VALID [2022-04-28 04:54:03,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 04:54:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:54:03,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:54:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:54:03,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774206945] [2022-04-28 04:54:03,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:54:03,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967456421] [2022-04-28 04:54:03,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967456421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:03,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:03,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:54:03,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:54:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083195951] [2022-04-28 04:54:03,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083195951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:03,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:03,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:54:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919431513] [2022-04-28 04:54:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:54:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 04:54:03,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:54:03,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:03,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:03,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:54:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:54:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:54:03,256 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:08,394 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-04-28 04:54:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:54:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 04:54:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:54:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 04:54:08,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 04:54:08,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:08,489 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:54:08,489 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:54:08,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:54:08,490 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:08,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:54:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:54:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 04:54:08,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:08,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:54:08,517 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:54:08,517 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:54:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:08,520 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:54:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:08,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:08,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:08,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 04:54:08,521 INFO L87 Difference]: Start difference. First operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-04-28 04:54:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:08,523 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 04:54:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:08,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:08,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:08,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:08,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:54:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-04-28 04:54:08,526 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2022-04-28 04:54:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:08,526 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-04-28 04:54:08,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 04:54:08,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 87 transitions. [2022-04-28 04:54:08,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 04:54:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:54:08,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:08,839 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:54:08,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:54:09,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:09,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-28 04:54:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:09,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397429450] [2022-04-28 04:54:09,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:54:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-28 04:54:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:09,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120763623] [2022-04-28 04:54:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:09,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667317654] [2022-04-28 04:54:09,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:09,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:09,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:09,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:54:09,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process