/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:59:37,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:59:37,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:59:37,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:59:37,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:59:37,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:59:37,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:59:37,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:59:37,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:59:37,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:59:37,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:59:37,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:59:37,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:59:37,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:59:37,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:59:37,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:59:37,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:59:37,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:59:37,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:59:37,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:59:37,750 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:59:37,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:59:37,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:59:37,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:59:37,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:59:37,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:59:37,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:59:37,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:59:37,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:59:37,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:59:37,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:59:37,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:59:37,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:59:37,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:59:37,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:59:37,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:59:37,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:59:37,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:59:37,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:59:37,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:59:37,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:59:37,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:59:37,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:59:37,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:59:37,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:59:37,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:59:37,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:59:37,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:59:37,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:59:37,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:59:37,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:59:37,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:59:37,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:59:37,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:59:37,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:59:37,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:59:37,775 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:59:37,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:59:37,776 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:59:37,776 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 12:59:37,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:59:37,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:59:37,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:59:37,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:59:37,992 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:59:37,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound100.c [2022-04-28 12:59:38,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b94cc5/fe64a05cecbe40548ddac0eefe01c75a/FLAG2beefe946 [2022-04-28 12:59:38,402 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:59:38,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound100.c [2022-04-28 12:59:38,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b94cc5/fe64a05cecbe40548ddac0eefe01c75a/FLAG2beefe946 [2022-04-28 12:59:38,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b94cc5/fe64a05cecbe40548ddac0eefe01c75a [2022-04-28 12:59:38,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:59:38,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:59:38,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:59:38,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:59:38,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:59:38,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88ac5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38, skipping insertion in model container [2022-04-28 12:59:38,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:59:38,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:59:38,598 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/hard-u_unwindbound100.c[537,550] [2022-04-28 12:59:38,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:59:38,620 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:59:38,627 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/hard-u_unwindbound100.c[537,550] [2022-04-28 12:59:38,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:59:38,650 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:59:38,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38 WrapperNode [2022-04-28 12:59:38,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:59:38,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:59:38,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:59:38,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:59:38,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:59:38,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:59:38,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:59:38,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:59:38,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (1/1) ... [2022-04-28 12:59:38,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:59:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:38,700 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 12:59:38,705 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 12:59:38,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:59:38,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:59:38,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:59:38,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:59:38,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:59:38,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:59:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:59:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:59:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:59:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:59:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:59:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:59:38,777 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:59:38,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:59:38,903 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:59:38,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:59:38,907 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 12:59:38,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:59:38 BoogieIcfgContainer [2022-04-28 12:59:38,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:59:38,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:59:38,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:59:38,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:59:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:59:38" (1/3) ... [2022-04-28 12:59:38,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5524c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:59:38, skipping insertion in model container [2022-04-28 12:59:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:59:38" (2/3) ... [2022-04-28 12:59:38,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5524c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:59:38, skipping insertion in model container [2022-04-28 12:59:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:59:38" (3/3) ... [2022-04-28 12:59:38,935 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound100.c [2022-04-28 12:59:38,945 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:59:38,945 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:59:39,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:59:39,009 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@f589635, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3685a192 [2022-04-28 12:59:39,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:59:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 12:59:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 12:59:39,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:39,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:59:39,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-28 12:59:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317375696] [2022-04-28 12:59:39,054 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-28 12:59:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:39,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642710119] [2022-04-28 12:59:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:59:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 12:59:39,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:59:39,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 12:59:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:59:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:59:39,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:59:39,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:59:39,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 12:59:39,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:59:39,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 12:59:39,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:59:39,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-28 12:59:39,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-28 12:59:39,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-28 12:59:39,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-28 12:59:39,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:59:39,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:59:39,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:59:39,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-28 12:59:39,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-28 12:59:39,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:59:39,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:59:39,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-28 12:59:39,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 12:59:39,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 12:59:39,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 12:59:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:59:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642710119] [2022-04-28 12:59:39,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642710119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:39,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:39,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:59:39,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317375696] [2022-04-28 12:59:39,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317375696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:39,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:39,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:59:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874177970] [2022-04-28 12:59:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:39,261 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 12:59:39,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:39,266 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:39,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:59:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:59:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:59:39,326 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:39,506 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-28 12:59:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:59:39,507 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 12:59:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:39,508 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 12:59:39,522 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 12:59:39,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 12:59:39,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:39,633 INFO L225 Difference]: With dead ends: 66 [2022-04-28 12:59:39,633 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 12:59:39,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:59:39,638 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:39,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:59:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 12:59:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-28 12:59:39,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:39,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:39,663 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:39,663 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:39,669 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 12:59:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 12:59:39,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:39,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:39,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 12:59:39,671 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-28 12:59:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:39,673 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-28 12:59:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 12:59:39,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:39,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:39,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:39,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 12:59:39,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-28 12:59:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:39,678 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 12:59:39,678 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 12:59:39,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 12:59:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 12:59:39,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:39,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:59:39,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:59:39,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-28 12:59:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732040390] [2022-04-28 12:59:39,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-28 12:59:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909918427] [2022-04-28 12:59:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:59:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-28 12:59:39,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:59:39,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 12:59:39,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:59:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:39,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 12:59:39,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 12:59:39,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:59:39,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 12:59:39,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:59:39,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-28 12:59:39,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:59:39,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-28 12:59:39,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-28 12:59:39,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID [2022-04-28 12:59:39,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-28 12:59:39,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-28 12:59:39,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-28 12:59:39,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-28 12:59:39,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-28 12:59:39,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:59:39,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:59:39,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 100);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-28 12:59:39,849 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:39,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:59:39,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-28 12:59:39,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-28 12:59:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:59:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909918427] [2022-04-28 12:59:39,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909918427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:39,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:39,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:39,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:39,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732040390] [2022-04-28 12:59:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732040390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699405145] [2022-04-28 12:59:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 12:59:39,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:39,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:39,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:39,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:59:39,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:39,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:59:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:59:39,869 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,189 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 12:59:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:59:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 12:59:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:59:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:59:40,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 12:59:40,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:40,262 INFO L225 Difference]: With dead ends: 47 [2022-04-28 12:59:40,263 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 12:59:40,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:59:40,265 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:40,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:59:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 12:59:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-28 12:59:40,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:40,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,278 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,280 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,293 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 12:59:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 12:59:40,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 12:59:40,294 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 12:59:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,296 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 12:59:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 12:59:40,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:40,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 12:59:40,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-28 12:59:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:40,302 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 12:59:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 12:59:40,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 12:59:40,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 12:59:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:59:40,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:40,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:59:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 12:59:40,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-28 12:59:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887598091] [2022-04-28 12:59:40,339 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-28 12:59:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:40,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935439119] [2022-04-28 12:59:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:40,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705679242] [2022-04-28 12:59:40,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:40,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:40,351 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 12:59:40,371 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 12:59:40,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:59:40,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:40,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:59:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:40,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:40,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-28 12:59:40,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:40,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {594#false} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 100);havoc #t~post7; {594#false} is VALID [2022-04-28 12:59:40,513 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-28 12:59:40,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-28 12:59:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:59:40,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:59:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935439119] [2022-04-28 12:59:40,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705679242] [2022-04-28 12:59:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705679242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:40,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:40,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:59:40,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:40,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887598091] [2022-04-28 12:59:40,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887598091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:40,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:40,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:59:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885213023] [2022-04-28 12:59:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:59:40,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:40,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:59:40,529 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 12:59:40,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:59:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:40,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:59:40,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:59:40,530 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:59:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,607 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-28 12:59:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:59:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 12:59:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:59:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 12:59:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:59:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-28 12:59:40,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-28 12:59:40,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:40,656 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:59:40,656 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 12:59:40,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:59:40,657 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:40,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:59:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 12:59:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 12:59:40,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:40,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,670 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,671 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,672 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 12:59:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:59:40,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 12:59:40,676 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-28 12:59:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:40,677 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 12:59:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:59:40,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:40,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:40,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:40,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 12:59:40,679 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-28 12:59:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:40,679 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 12:59:40,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 12:59:40,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-28 12:59:40,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 12:59:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:59:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:40,714 INFO L195 NwaCegarLoop]: trace histogram [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 12:59:40,745 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 12:59:40,918 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 12:59:40,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-28 12:59:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648341392] [2022-04-28 12:59:40,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-28 12:59:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937891496] [2022-04-28 12:59:40,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:59:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:41,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-28 12:59:41,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 12:59:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:59:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:41,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:59:41,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:59:41,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 12:59:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 12:59:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:41,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:59:41,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:59:41,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 12:59:41,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:59:41,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-28 12:59:41,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-28 12:59:41,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-28 12:59:41,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID [2022-04-28 12:59:41,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-28 12:59:41,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:59:41,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:59:41,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-28 12:59:41,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 12:59:41,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 12:59:41,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 100);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 12:59:41,053 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID [2022-04-28 12:59:41,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-28 12:59:41,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-28 12:59:41,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-28 12:59:41,054 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 12:59:41,055 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:59:41,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:59:41,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-28 12:59:41,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-28 12:59:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 12:59:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937891496] [2022-04-28 12:59:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937891496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:41,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648341392] [2022-04-28 12:59:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648341392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559246386] [2022-04-28 12:59:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:59:41,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:41,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:59:41,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:41,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:59:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:41,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:59:41,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:59:41,074 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:59:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:41,384 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:59:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:59:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:59:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:59:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:59:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:59:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 12:59:41,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 12:59:41,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:41,471 INFO L225 Difference]: With dead ends: 52 [2022-04-28 12:59:41,471 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 12:59:41,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:59:41,472 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:41,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:59:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 12:59:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-28 12:59:41,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:41,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:41,485 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:41,485 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:41,487 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 12:59:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:59:41,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:41,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:41,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 12:59:41,488 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-28 12:59:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:41,490 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 12:59:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:59:41,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:41,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:41,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:41,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 12:59:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 12:59:41,491 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-28 12:59:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:41,492 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 12:59:41,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:59:41,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 12:59:41,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 12:59:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 12:59:41,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:41,530 INFO L195 NwaCegarLoop]: trace histogram [3, 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 12:59:41,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 12:59:41,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:41,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-28 12:59:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049367435] [2022-04-28 12:59:41,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-28 12:59:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77631201] [2022-04-28 12:59:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:41,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441513671] [2022-04-28 12:59:41,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:41,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:41,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:41,560 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 12:59:41,561 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 12:59:41,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:59:41,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:41,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:59:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:41,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:41,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID [2022-04-28 12:59:41,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-28 12:59:41,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:59:41,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:59:41,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:59:41,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-28 12:59:41,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 12:59:41,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 12:59:41,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 12:59:41,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-28 12:59:41,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:59:41,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:59:41,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:59:41,693 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 12:59:41,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-28 12:59:41,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-28 12:59:41,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-28 12:59:41,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-28 12:59:41,694 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 12:59:41,694 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:59:41,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:59:41,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-28 12:59:41,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-28 12:59:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:59:41,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:59:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77631201] [2022-04-28 12:59:41,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:41,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441513671] [2022-04-28 12:59:41,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441513671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:41,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:41,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:41,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:41,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049367435] [2022-04-28 12:59:41,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049367435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:41,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:41,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104115102] [2022-04-28 12:59:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 12:59:41,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:41,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:59:41,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:41,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:59:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:59:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:59:41,712 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:59:43,861 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 12:59:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,038 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 12:59:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:59:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 12:59:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:59:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 12:59:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:59:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-28 12:59:44,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-28 12:59:44,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:44,096 INFO L225 Difference]: With dead ends: 59 [2022-04-28 12:59:44,096 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 12:59:44,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 12:59:44,097 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:44,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 12:59:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 12:59:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 12:59:44,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:44,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,112 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,112 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,114 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 12:59:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 12:59:44,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:44,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:44,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 12:59:44,115 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-28 12:59:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,116 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-28 12:59:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 12:59:44,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:44,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:44,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:44,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-28 12:59:44,119 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-28 12:59:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:44,119 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-28 12:59:44,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 12:59:44,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-28 12:59:44,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-28 12:59:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:59:44,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:44,197 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 12:59:44,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:59:44,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:44,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-28 12:59:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:44,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742553917] [2022-04-28 12:59:44,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-28 12:59:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611076417] [2022-04-28 12:59:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:44,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:44,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705694132] [2022-04-28 12:59:44,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:44,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:44,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:44,425 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 12:59:44,426 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 12:59:44,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:59:44,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:44,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:59:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:44,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:44,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-28 12:59:44,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:44,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,667 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,668 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,669 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,669 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,670 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:44,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:59:44,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1660#false} is VALID [2022-04-28 12:59:44,673 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-28 12:59:44,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-28 12:59:44,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-28 12:59:44,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-28 12:59:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 12:59:44,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:59:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:44,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611076417] [2022-04-28 12:59:44,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:44,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705694132] [2022-04-28 12:59:44,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705694132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:44,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:44,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:44,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742553917] [2022-04-28 12:59:44,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742553917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:44,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:44,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397968942] [2022-04-28 12:59:44,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:44,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 12:59:44,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:44,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:59:44,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:44,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:59:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:59:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:59:44,698 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:59:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,871 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-28 12:59:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:59:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-28 12:59:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:59:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:59:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:59:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:59:44,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:59:44,919 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 12:59:44,920 INFO L225 Difference]: With dead ends: 76 [2022-04-28 12:59:44,920 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 12:59:44,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:59:44,921 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:44,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:59:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 12:59:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 12:59:44,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:44,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,949 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,949 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,950 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 12:59:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 12:59:44,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:44,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:44,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 12:59:44,951 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-28 12:59:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:44,953 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 12:59:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 12:59:44,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:44,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:44,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:44,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:59:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-28 12:59:44,955 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-28 12:59:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:44,955 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-28 12:59:44,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:59:44,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions. [2022-04-28 12:59:45,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-28 12:59:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:59:45,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:45,032 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 12:59:45,049 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 12:59:45,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:45,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-28 12:59:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:45,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957179085] [2022-04-28 12:59:45,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:59:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-28 12:59:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:45,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60405694] [2022-04-28 12:59:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:45,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135761210] [2022-04-28 12:59:45,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:45,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:45,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:45,245 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 12:59:45,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:59:45,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:59:45,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:59:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:45,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:45,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 12:59:45,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 12:59:45,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID [2022-04-28 12:59:45,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 100);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,752 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 12:59:45,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 12:59:45,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 12:59:45,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 12:59:45,755 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,755 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 12:59:45,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 12:59:45,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 12:59:45,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 12:59:45,756 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,756 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 12:59:45,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 12:59:45,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 12:59:45,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 12:59:45,756 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 12:59:45,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 12:59:45,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 12:59:45,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 12:59:45,776 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:59:45,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:59:45,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID [2022-04-28 12:59:45,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-28 12:59:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 12:59:45,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:59:45,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:45,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60405694] [2022-04-28 12:59:45,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:45,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135761210] [2022-04-28 12:59:45,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135761210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:45,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:45,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:45,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957179085] [2022-04-28 12:59:45,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957179085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:45,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:45,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:59:45,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496754249] [2022-04-28 12:59:45,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:45,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:45,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:45,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:45,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:59:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:59:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:59:45,800 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:49,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:59:51,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:59:55,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:59:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:55,298 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-28 12:59:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:59:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 12:59:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 12:59:55,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-28 12:59:55,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:55,377 INFO L225 Difference]: With dead ends: 82 [2022-04-28 12:59:55,378 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 12:59:55,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:59:55,378 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:55,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 163 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2022-04-28 12:59:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 12:59:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-28 12:59:55,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:55,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:59:55,419 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:59:55,419 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:59:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:55,421 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 12:59:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 12:59:55,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:55,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:55,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 12:59:55,422 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-28 12:59:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:55,423 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-28 12:59:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-28 12:59:55,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:55,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:55,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:55,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 12:59:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-28 12:59:55,426 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-28 12:59:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:55,426 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-28 12:59:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 12:59:55,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions. [2022-04-28 12:59:55,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-28 12:59:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 12:59:55,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:55,523 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-28 12:59:55,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 12:59:55,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:55,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-28 12:59:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:55,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26535144] [2022-04-28 12:59:56,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:59:56,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:59:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 2 times [2022-04-28 12:59:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637112326] [2022-04-28 12:59:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:56,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529165059] [2022-04-28 12:59:56,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:56,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:59:56,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:59:56,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:59:56,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:56,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:59:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:56,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:56,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID [2022-04-28 12:59:56,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 12:59:56,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 12:59:56,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 12:59:56,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID [2022-04-28 12:59:56,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,844 INFO L272 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 12:59:56,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 12:59:56,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 12:59:56,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 12:59:56,845 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,845 INFO L272 TraceCheckUtils]: 19: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 12:59:56,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 12:59:56,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 12:59:56,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 12:59:56,846 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #84#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,846 INFO L272 TraceCheckUtils]: 24: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2792#true} is VALID [2022-04-28 12:59:56,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-28 12:59:56,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-28 12:59:56,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-28 12:59:56,847 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2792#true} {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #86#return; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 100);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 100);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 12:59:56,850 INFO L272 TraceCheckUtils]: 34: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:59:56,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {2900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:59:56,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {2904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-28 12:59:56,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-28 12:59:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 12:59:56,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:59:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637112326] [2022-04-28 12:59:56,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529165059] [2022-04-28 12:59:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529165059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:56,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:56,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:56,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26535144] [2022-04-28 12:59:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26535144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:56,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:56,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591512806] [2022-04-28 12:59:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:56,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 38 [2022-04-28 12:59:56,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:56,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:59:56,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:59:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:59:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:59:56,877 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:59:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:57,191 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-28 12:59:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:59:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 38 [2022-04-28 12:59:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:59:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:59:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 12:59:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:59:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 12:59:57,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-28 12:59:57,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:57,243 INFO L225 Difference]: With dead ends: 92 [2022-04-28 12:59:57,243 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 12:59:57,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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 12:59:57,244 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:59:57,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:59:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 12:59:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 12:59:57,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:59:57,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:59:57,296 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:59:57,297 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:59:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:57,299 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-28 12:59:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 12:59:57,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:57,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:57,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-28 12:59:57,300 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 90 states. [2022-04-28 12:59:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:59:57,302 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-28 12:59:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 12:59:57,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:59:57,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:59:57,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:59:57,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:59:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:59:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2022-04-28 12:59:57,305 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 38 [2022-04-28 12:59:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:59:57,305 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2022-04-28 12:59:57,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 12:59:57,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 109 transitions. [2022-04-28 12:59:57,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2022-04-28 12:59:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 12:59:57,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:59:57,558 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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 12:59:57,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:59:57,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:57,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:59:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:59:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-28 12:59:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:57,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [914804626] [2022-04-28 12:59:58,844 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:59:58,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:59:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-28 12:59:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:59:58,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366287601] [2022-04-28 12:59:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:59:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:59:58,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:59:58,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388908827] [2022-04-28 12:59:58,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:59:58,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:59:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:59:58,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:59:58,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:59:58,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:59:58,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:59:58,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:59:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:59:58,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:59:59,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-28 12:59:59,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#(<= ~counter~0 0)} {3454#true} #96#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#(<= ~counter~0 0)} call #t~ret8 := main(); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {3462#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#(<= ~counter~0 0)} ~cond := #in~cond; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#(<= ~counter~0 0)} assume !(0 == ~cond); {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#(<= ~counter~0 0)} assume true; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3462#(<= ~counter~0 0)} {3462#(<= ~counter~0 0)} #80#return; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {3462#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3462#(<= ~counter~0 0)} is VALID [2022-04-28 12:59:59,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {3462#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,089 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #82#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,090 INFO L272 TraceCheckUtils]: 19: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,091 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #84#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,091 INFO L272 TraceCheckUtils]: 24: Hoare triple {3496#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {3496#(<= ~counter~0 1)} ~cond := #in~cond; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {3496#(<= ~counter~0 1)} assume !(0 == ~cond); {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {3496#(<= ~counter~0 1)} assume true; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,093 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3496#(<= ~counter~0 1)} {3496#(<= ~counter~0 1)} #86#return; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {3496#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3496#(<= ~counter~0 1)} is VALID [2022-04-28 12:59:59,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {3496#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3551#(<= |main_#t~post6| 1)} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 100);havoc #t~post7; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#false} assume !(0 == ~cond); {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#false} assume true; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3455#false} {3455#false} #92#return; {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 12:59:59,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 12:59:59,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-28 12:59:59,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-28 12:59:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 12:59:59,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:59:59,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#false} assume !false; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#false} assume 0 == ~cond; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {3455#false} ~cond := #in~cond; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L272 TraceCheckUtils]: 39: Hoare triple {3455#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 % 4294967296 then 1 else 0)); {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3454#true} {3455#false} #92#return; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 12:59:59,302 INFO L272 TraceCheckUtils]: 34: Hoare triple {3455#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#false} assume !(#t~post7 < 100);havoc #t~post7; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3455#false} is VALID [2022-04-28 12:59:59,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {3621#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {3455#false} is VALID [2022-04-28 12:59:59,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3621#(< |main_#t~post6| 100)} is VALID [2022-04-28 12:59:59,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#(< ~counter~0 100)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,304 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3454#true} {3625#(< ~counter~0 100)} #86#return; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 12:59:59,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 12:59:59,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 12:59:59,304 INFO L272 TraceCheckUtils]: 24: Hoare triple {3625#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 12:59:59,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3454#true} {3625#(< ~counter~0 100)} #84#return; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 12:59:59,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 12:59:59,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 12:59:59,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {3625#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 12:59:59,306 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3454#true} {3625#(< ~counter~0 100)} #82#return; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 12:59:59,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 12:59:59,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 12:59:59,306 INFO L272 TraceCheckUtils]: 14: Hoare triple {3625#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3454#true} is VALID [2022-04-28 12:59:59,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {3625#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {3680#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3625#(< ~counter~0 100)} is VALID [2022-04-28 12:59:59,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {3680#(< ~counter~0 99)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3454#true} {3680#(< ~counter~0 99)} #80#return; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {3454#true} assume true; {3454#true} is VALID [2022-04-28 12:59:59,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {3454#true} assume !(0 == ~cond); {3454#true} is VALID [2022-04-28 12:59:59,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {3454#true} ~cond := #in~cond; {3454#true} is VALID [2022-04-28 12:59:59,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {3680#(< ~counter~0 99)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3454#true} is VALID [2022-04-28 12:59:59,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {3680#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {3680#(< ~counter~0 99)} call #t~ret8 := main(); {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3680#(< ~counter~0 99)} {3454#true} #96#return; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {3680#(< ~counter~0 99)} assume true; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3454#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3680#(< ~counter~0 99)} is VALID [2022-04-28 12:59:59,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {3454#true} call ULTIMATE.init(); {3454#true} is VALID [2022-04-28 12:59:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:59:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:59:59,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366287601] [2022-04-28 12:59:59,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:59:59,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388908827] [2022-04-28 12:59:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388908827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:59:59,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:59:59,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 12:59:59,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:59:59,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [914804626] [2022-04-28 12:59:59,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [914804626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:59:59,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:59:59,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:59:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047628212] [2022-04-28 12:59:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:59:59,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 12:59:59,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:59:59,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:59:59,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:59:59,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:59:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:59:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:59:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:59:59,337 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 13:00:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,199 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-28 13:00:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:00:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-28 13:00:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:00:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 13:00:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 13:00:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 13:00:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 13:00:00,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-28 13:00:00,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:00,261 INFO L225 Difference]: With dead ends: 116 [2022-04-28 13:00:00,261 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 13:00:00,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:00:00,262 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:00:00,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:00:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 13:00:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 13:00:00,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:00:00,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:00:00,313 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:00:00,313 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:00:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,315 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 13:00:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 13:00:00,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:00,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:00,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-28 13:00:00,316 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 91 states. [2022-04-28 13:00:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:00,317 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2022-04-28 13:00:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 13:00:00,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:00,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:00,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:00:00,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:00:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:00:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2022-04-28 13:00:00,319 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 43 [2022-04-28 13:00:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:00:00,320 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2022-04-28 13:00:00,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 13:00:00,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 111 transitions. [2022-04-28 13:00:00,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2022-04-28 13:00:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 13:00:00,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:00:00,777 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:00:00,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 13:00:00,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:00,978 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:00:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:00:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-28 13:00:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:00,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777253949] [2022-04-28 13:00:02,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:00:02,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:00:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-28 13:00:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:00:02,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106711587] [2022-04-28 13:00:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:00:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:00:02,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:00:02,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041947219] [2022-04-28 13:00:02,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:00:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:00:02,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:00:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 13:00:02,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:00:02,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:00:02,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 13:00:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:00:02,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:00:03,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2022-04-28 13:00:03,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {4317#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4317#true} is VALID [2022-04-28 13:00:03,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #96#return; {4317#true} is VALID [2022-04-28 13:00:03,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret8 := main(); {4317#true} is VALID [2022-04-28 13:00:03,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {4317#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4317#true} is VALID [2022-04-28 13:00:03,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {4317#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {4317#true} ~cond := #in~cond; {4343#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 13:00:03,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {4343#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4347#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:00:03,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {4347#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4347#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 13:00:03,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4347#(not (= |assume_abort_if_not_#in~cond| 0))} {4317#true} #80#return; {4354#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-28 13:00:03,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {4354#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,354 INFO L272 TraceCheckUtils]: 14: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:03,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:03,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,354 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,355 INFO L272 TraceCheckUtils]: 24: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:03,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,356 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4317#true} {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:00:03,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {4358#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:00:03,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:00:03,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:00:03,357 INFO L272 TraceCheckUtils]: 32: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:03,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:03,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,358 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4317#true} {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:00:03,358 INFO L272 TraceCheckUtils]: 37: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:03,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:03,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:03,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:03,358 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4317#true} {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-28 13:00:03,364 INFO L272 TraceCheckUtils]: 42: Hoare triple {4413#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:00:03,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:00:03,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {4457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4318#false} is VALID [2022-04-28 13:00:03,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2022-04-28 13:00:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:00:03,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:00:06,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2022-04-28 13:00:06,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {4457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4318#false} is VALID [2022-04-28 13:00:06,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:00:06,214 INFO L272 TraceCheckUtils]: 42: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:00:06,215 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4317#true} {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 13:00:06,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:06,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:06,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:06,215 INFO L272 TraceCheckUtils]: 37: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:06,215 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4317#true} {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 13:00:06,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:06,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:06,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:06,216 INFO L272 TraceCheckUtils]: 32: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:06,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 13:00:06,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 13:00:07,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4473#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 13:00:07,697 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:07,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:07,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:07,697 INFO L272 TraceCheckUtils]: 24: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:07,698 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:07,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:07,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:07,698 INFO L272 TraceCheckUtils]: 19: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:07,699 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4317#true} {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:07,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:07,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:07,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:07,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {4317#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4513#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 13:00:07,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4317#true} {4317#true} #80#return; {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {4317#true} assume !(0 == ~cond); {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {4317#true} ~cond := #in~cond; {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {4317#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {4317#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret8 := main(); {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #96#return; {4317#true} is VALID [2022-04-28 13:00:07,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2022-04-28 13:00:07,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {4317#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4317#true} is VALID [2022-04-28 13:00:07,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2022-04-28 13:00:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:00:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:00:07,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106711587] [2022-04-28 13:00:07,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:00:07,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041947219] [2022-04-28 13:00:07,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041947219] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 13:00:07,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 13:00:07,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-28 13:00:07,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:00:07,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777253949] [2022-04-28 13:00:07,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777253949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:00:07,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:00:07,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:00:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864967226] [2022-04-28 13:00:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:00:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 13:00:07,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:00:07,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 13:00:09,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:00:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:00:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 13:00:09,739 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 13:00:12,917 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 13:00:15,243 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 13:00:19,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:00:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:20,127 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-04-28 13:00:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:00:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-28 13:00:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:00:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 13:00:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:00:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 13:00:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:00:20,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 13:00:22,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:22,194 INFO L225 Difference]: With dead ends: 104 [2022-04-28 13:00:22,194 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 13:00:22,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:00:22,195 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:00:22,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 13:00:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 13:00:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-04-28 13:00:22,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:00:22,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:00:22,264 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:00:22,265 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:00:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:22,266 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 13:00:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 13:00:22,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:22,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:22,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-28 13:00:22,267 INFO L87 Difference]: Start difference. First operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 102 states. [2022-04-28 13:00:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:22,269 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 13:00:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 13:00:22,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:22,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:22,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:00:22,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:00:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:00:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-04-28 13:00:22,271 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 46 [2022-04-28 13:00:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:00:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-04-28 13:00:22,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 13:00:22,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 121 transitions. [2022-04-28 13:00:25,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 120 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-04-28 13:00:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 13:00:25,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:00:25,029 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1] [2022-04-28 13:00:25,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 13:00:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:25,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:00:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:00:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-28 13:00:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:25,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1110730356] [2022-04-28 13:00:25,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:00:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 2 times [2022-04-28 13:00:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:00:25,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562821515] [2022-04-28 13:00:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:00:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:00:25,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:00:25,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438007245] [2022-04-28 13:00:25,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:00:25,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:00:25,239 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:00:25,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 13:00:25,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:00:25,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:00:25,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:00:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:00:25,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:00:25,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {5215#true} call ULTIMATE.init(); {5215#true} is VALID [2022-04-28 13:00:25,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#(<= ~counter~0 0)} assume true; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#(<= ~counter~0 0)} {5215#true} #96#return; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#(<= ~counter~0 0)} call #t~ret8 := main(); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {5223#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {5223#(<= ~counter~0 0)} ~cond := #in~cond; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {5223#(<= ~counter~0 0)} assume !(0 == ~cond); {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(<= ~counter~0 0)} assume true; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5223#(<= ~counter~0 0)} {5223#(<= ~counter~0 0)} #80#return; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5223#(<= ~counter~0 0)} is VALID [2022-04-28 13:00:25,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {5223#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,559 INFO L272 TraceCheckUtils]: 14: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,560 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #82#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,561 INFO L272 TraceCheckUtils]: 19: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,562 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #84#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,562 INFO L272 TraceCheckUtils]: 24: Hoare triple {5257#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {5257#(<= ~counter~0 1)} ~cond := #in~cond; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {5257#(<= ~counter~0 1)} assume !(0 == ~cond); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {5257#(<= ~counter~0 1)} assume true; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,563 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5257#(<= ~counter~0 1)} {5257#(<= ~counter~0 1)} #86#return; {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {5257#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {5257#(<= ~counter~0 1)} is VALID [2022-04-28 13:00:25,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {5257#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {5312#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,565 INFO L272 TraceCheckUtils]: 32: Hoare triple {5312#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {5312#(<= ~counter~0 2)} ~cond := #in~cond; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {5312#(<= ~counter~0 2)} assume !(0 == ~cond); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {5312#(<= ~counter~0 2)} assume true; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,566 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5312#(<= ~counter~0 2)} {5312#(<= ~counter~0 2)} #88#return; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,567 INFO L272 TraceCheckUtils]: 37: Hoare triple {5312#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {5312#(<= ~counter~0 2)} ~cond := #in~cond; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {5312#(<= ~counter~0 2)} assume !(0 == ~cond); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {5312#(<= ~counter~0 2)} assume true; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,568 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5312#(<= ~counter~0 2)} {5312#(<= ~counter~0 2)} #90#return; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {5312#(<= ~counter~0 2)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {5312#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5312#(<= ~counter~0 2)} is VALID [2022-04-28 13:00:25,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {5312#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5355#(<= |main_#t~post7| 2)} is VALID [2022-04-28 13:00:25,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {5355#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {5216#false} is VALID [2022-04-28 13:00:25,569 INFO L272 TraceCheckUtils]: 46: Hoare triple {5216#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {5216#false} is VALID [2022-04-28 13:00:25,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {5216#false} ~cond := #in~cond; {5216#false} is VALID [2022-04-28 13:00:25,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {5216#false} assume 0 == ~cond; {5216#false} is VALID [2022-04-28 13:00:25,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {5216#false} assume !false; {5216#false} is VALID [2022-04-28 13:00:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 13:00:25,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:00:25,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {5216#false} assume !false; {5216#false} is VALID [2022-04-28 13:00:25,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {5216#false} assume 0 == ~cond; {5216#false} is VALID [2022-04-28 13:00:25,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {5216#false} ~cond := #in~cond; {5216#false} is VALID [2022-04-28 13:00:25,833 INFO L272 TraceCheckUtils]: 46: Hoare triple {5216#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {5216#false} is VALID [2022-04-28 13:00:25,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {5383#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {5216#false} is VALID [2022-04-28 13:00:25,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {5387#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5383#(< |main_#t~post7| 100)} is VALID [2022-04-28 13:00:25,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {5387#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {5387#(< ~counter~0 100)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,835 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5215#true} {5387#(< ~counter~0 100)} #90#return; {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,835 INFO L272 TraceCheckUtils]: 37: Hoare triple {5387#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,836 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5215#true} {5387#(< ~counter~0 100)} #88#return; {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,837 INFO L272 TraceCheckUtils]: 32: Hoare triple {5387#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {5387#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {5430#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5387#(< ~counter~0 100)} is VALID [2022-04-28 13:00:25,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {5430#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,844 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5215#true} {5430#(< ~counter~0 99)} #86#return; {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,845 INFO L272 TraceCheckUtils]: 24: Hoare triple {5430#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5215#true} {5430#(< ~counter~0 99)} #84#return; {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,845 INFO L272 TraceCheckUtils]: 19: Hoare triple {5430#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,846 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5215#true} {5430#(< ~counter~0 99)} #82#return; {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,846 INFO L272 TraceCheckUtils]: 14: Hoare triple {5430#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {5430#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {5485#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5430#(< ~counter~0 99)} is VALID [2022-04-28 13:00:25,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {5485#(< ~counter~0 98)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5215#true} {5485#(< ~counter~0 98)} #80#return; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {5215#true} assume true; {5215#true} is VALID [2022-04-28 13:00:25,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {5215#true} assume !(0 == ~cond); {5215#true} is VALID [2022-04-28 13:00:25,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {5215#true} ~cond := #in~cond; {5215#true} is VALID [2022-04-28 13:00:25,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {5485#(< ~counter~0 98)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5215#true} is VALID [2022-04-28 13:00:25,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {5485#(< ~counter~0 98)} call #t~ret8 := main(); {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5485#(< ~counter~0 98)} {5215#true} #96#return; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#(< ~counter~0 98)} assume true; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5485#(< ~counter~0 98)} is VALID [2022-04-28 13:00:25,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {5215#true} call ULTIMATE.init(); {5215#true} is VALID [2022-04-28 13:00:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:00:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:00:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562821515] [2022-04-28 13:00:25,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:00:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438007245] [2022-04-28 13:00:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438007245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:00:25,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:00:25,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:00:25,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:00:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1110730356] [2022-04-28 13:00:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1110730356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:00:25,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:00:25,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:00:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439745009] [2022-04-28 13:00:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:00:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 13:00:25,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:00:25,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 13:00:25,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:25,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:00:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:00:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:00:25,886 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 13:00:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:27,039 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2022-04-28 13:00:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 13:00:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 13:00:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:00:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 13:00:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 13:00:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 13:00:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 13:00:27,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-04-28 13:00:27,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:27,126 INFO L225 Difference]: With dead ends: 145 [2022-04-28 13:00:27,126 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 13:00:27,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 13:00:27,126 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:00:27,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 139 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 13:00:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 13:00:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-04-28 13:00:27,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:00:27,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:00:27,238 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:00:27,239 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:00:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:27,241 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-28 13:00:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-28 13:00:27,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:27,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:27,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) Second operand 127 states. [2022-04-28 13:00:27,242 INFO L87 Difference]: Start difference. First operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) Second operand 127 states. [2022-04-28 13:00:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:00:27,244 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-28 13:00:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-28 13:00:27,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:00:27,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:00:27,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:00:27,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:00:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:00:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2022-04-28 13:00:27,246 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 50 [2022-04-28 13:00:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:00:27,246 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2022-04-28 13:00:27,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 13:00:27,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 149 transitions. [2022-04-28 13:00:32,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 147 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 13:00:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2022-04-28 13:00:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 13:00:32,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:00:32,314 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 13:00:32,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 13:00:32,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 13:00:32,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:00:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:00:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-28 13:00:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:00:32,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904955890] [2022-04-28 13:00:32,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:00:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 2 times [2022-04-28 13:00:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:00:32,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449557818] [2022-04-28 13:00:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:00:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:00:32,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:00:32,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021145101] [2022-04-28 13:00:32,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:00:32,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:00:32,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:00:32,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:00:32,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process