/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:58:46,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:58:46,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:58:46,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:58:46,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:58:46,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:58:46,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:58:46,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:58:46,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:58:46,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:58:46,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:58:46,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:58:46,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:58:46,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:58:46,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:58:46,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:58:46,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:58:46,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:58:46,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:58:46,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:58:46,687 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:58:46,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:58:46,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:58:46,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:58:46,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:58:46,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:58:46,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:58:46,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:58:46,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:58:46,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:58:46,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:58:46,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:58:46,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:58:46,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:58:46,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:58:46,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:58:46,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:58:46,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:58:46,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:58:46,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:58:46,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:58:46,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:58:46,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:58:46,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:58:46,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:58:46,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:58:46,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:58:46,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:58:46,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:58:46,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:58:46,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:58:46,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:58:46,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:58:46,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:58:46,709 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:58:46,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:58:46,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:58:46,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:58:46,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:58:46,907 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:58:46,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i [2022-04-28 04:58:46,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d779a1bd8/d4d60b42a65d4fd3a56942390eb89d78/FLAG2c85a2b3f [2022-04-28 04:58:47,311 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:58:47,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i [2022-04-28 04:58:47,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d779a1bd8/d4d60b42a65d4fd3a56942390eb89d78/FLAG2c85a2b3f [2022-04-28 04:58:47,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d779a1bd8/d4d60b42a65d4fd3a56942390eb89d78 [2022-04-28 04:58:47,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:58:47,325 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:58:47,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:58:47,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:58:47,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:58:47,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33eb9875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47, skipping insertion in model container [2022-04-28 04:58:47,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:58:47,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:58:47,448 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/divbin2_unwindbound100.i[951,964] [2022-04-28 04:58:47,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:58:47,470 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:58:47,477 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/divbin2_unwindbound100.i[951,964] [2022-04-28 04:58:47,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:58:47,496 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:58:47,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47 WrapperNode [2022-04-28 04:58:47,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:58:47,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:58:47,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:58:47,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:58:47,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:58:47,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:58:47,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:58:47,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:58:47,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (1/1) ... [2022-04-28 04:58:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:58:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:47,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:58:47,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:58:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:58:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:58:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:58:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:58:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:58:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:58:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:58:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:58:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:58:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:58:47,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:58:47,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:58:47,628 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:58:47,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:58:47,751 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:58:47,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:58:47,755 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:58:47,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:58:47 BoogieIcfgContainer [2022-04-28 04:58:47,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:58:47,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:58:47,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:58:47,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:58:47,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:58:47" (1/3) ... [2022-04-28 04:58:47,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be90480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:58:47, skipping insertion in model container [2022-04-28 04:58:47,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:58:47" (2/3) ... [2022-04-28 04:58:47,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be90480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:58:47, skipping insertion in model container [2022-04-28 04:58:47,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:58:47" (3/3) ... [2022-04-28 04:58:47,777 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound100.i [2022-04-28 04:58:47,786 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:58:47,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:58:47,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:58:47,824 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@4f1c0fec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8b0b305 [2022-04-28 04:58:47,824 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:58:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:58:47,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:47,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:47,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-28 04:58:47,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:47,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337645912] [2022-04-28 04:58:47,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:58:47,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-28 04:58:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026553023] [2022-04-28 04:58:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:58:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:48,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-28 04:58:48,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:58:48,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-28 04:58:48,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:58:48,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-28 04:58:48,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 04:58:48,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-28 04:58:48,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-28 04:58:48,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-28 04:58:48,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 04:58:48,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-28 04:58:48,018 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-28 04:58:48,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 04:58:48,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 04:58:48,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 04:58:48,019 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 04:58:48,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:48,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026553023] [2022-04-28 04:58:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026553023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:58:48,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:48,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337645912] [2022-04-28 04:58:48,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337645912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:58:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561884914] [2022-04-28 04:58:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:58:48,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:48,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:58:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:58:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:58:48,061 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,143 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 04:58:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:58:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:58:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 04:58:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 04:58:48,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-28 04:58:48,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,224 INFO L225 Difference]: With dead ends: 44 [2022-04-28 04:58:48,224 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 04:58:48,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:58:48,228 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:48,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 04:58:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 04:58:48,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:48,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,258 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,258 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,261 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 04:58:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 04:58:48,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:48,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:48,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-28 04:58:48,263 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-28 04:58:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,266 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 04:58:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 04:58:48,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:48,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:48,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:48,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-28 04:58:48,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-28 04:58:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:48,269 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-28 04:58:48,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-28 04:58:48,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 04:58:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:58:48,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:48,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:58:48,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-28 04:58:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612142829] [2022-04-28 04:58:48,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:58:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-28 04:58:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:48,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611724864] [2022-04-28 04:58:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:58:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:48,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:58:48,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-28 04:58:48,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 100);havoc #t~post2; {212#false} is VALID [2022-04-28 04:58:48,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-28 04:58:48,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 100);havoc #t~post3; {212#false} is VALID [2022-04-28 04:58:48,432 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-28 04:58:48,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-28 04:58:48,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-28 04:58:48,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-28 04:58:48,433 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 04:58:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611724864] [2022-04-28 04:58:48,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611724864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:58:48,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:48,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612142829] [2022-04-28 04:58:48,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612142829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:58:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126183428] [2022-04-28 04:58:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:58:48,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:48,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:58:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:58:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:58:48,450 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,570 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 04:58:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:58:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:58:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:58:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:58:48,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 04:58:48,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,613 INFO L225 Difference]: With dead ends: 35 [2022-04-28 04:58:48,613 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:58:48,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:58:48,616 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:48,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:58:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:58:48,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:48,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,631 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,632 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,633 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 04:58:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:58:48,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:48,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:48,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 04:58:48,636 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 04:58:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,637 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 04:58:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:58:48,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:48,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:48,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:48,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 04:58:48,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-28 04:58:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:48,643 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 04:58:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 04:58:48,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:58:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:58:48,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:48,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:48,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:58:48,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:48,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-28 04:58:48,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:48,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [435079857] [2022-04-28 04:58:48,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:58:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-28 04:58:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226509927] [2022-04-28 04:58:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:48,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:48,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698175337] [2022-04-28 04:58:48,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:48,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:48,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:48,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:58:48,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:58:48,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:58:48,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:48,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:58:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:48,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:48,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 04:58:48,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(10, 2);~counter~0 := 0; {393#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {393#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:48,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:48,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:48,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:48,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-28 04:58:48,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 100);havoc #t~post3; {386#false} is VALID [2022-04-28 04:58:48,902 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-28 04:58:48,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-28 04:58:48,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-28 04:58:48,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 04:58:48,902 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 04:58:48,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:58:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:48,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226509927] [2022-04-28 04:58:48,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:48,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698175337] [2022-04-28 04:58:48,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698175337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:58:48,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [435079857] [2022-04-28 04:58:48,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [435079857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:48,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:48,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:58:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833385643] [2022-04-28 04:58:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:58:48,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:48,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:48,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:58:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:48,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:58:48,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:58:48,921 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:48,998 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-28 04:58:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:58:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:58:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:58:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:58:49,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 04:58:49,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:49,031 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:58:49,031 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:58:49,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 04:58:49,036 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:49,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:58:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 04:58:49,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:49,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:49,055 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:49,055 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:49,057 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-28 04:58:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 04:58:49,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:49,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:49,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-28 04:58:49,059 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-28 04:58:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:49,075 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-28 04:58:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 04:58:49,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:49,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:49,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:49,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-28 04:58:49,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-28 04:58:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:49,077 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-28 04:58:49,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-28 04:58:49,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-28 04:58:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:58:49,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:49,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:49,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:58:49,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:49,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-28 04:58:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812838826] [2022-04-28 04:58:49,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:58:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-28 04:58:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:49,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509880859] [2022-04-28 04:58:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:49,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:49,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77937519] [2022-04-28 04:58:49,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:49,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:58:49,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:58:49,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:58:49,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:49,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 04:58:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:49,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:49,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 04:58:49,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(10, 2);~counter~0 := 0; {608#true} is VALID [2022-04-28 04:58:49,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 04:58:49,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-28 04:58:49,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-28 04:58:49,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 100);havoc #t~post3; {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:49,611 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:58:49,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:58:49,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 04:58:49,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 04:58:49,612 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 04:58:49,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:58:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509880859] [2022-04-28 04:58:49,613 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77937519] [2022-04-28 04:58:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77937519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:49,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:49,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:58:49,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812838826] [2022-04-28 04:58:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812838826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:49,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:49,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:58:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532108881] [2022-04-28 04:58:49,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:58:49,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:49,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:49,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:58:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:58:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:58:49,626 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:49,787 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 04:58:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:58:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:58:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 04:58:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 04:58:49,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 04:58:49,818 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 04:58:49,819 INFO L225 Difference]: With dead ends: 35 [2022-04-28 04:58:49,819 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:58:49,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:58:49,820 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:49,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:58:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 04:58:49,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:49,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:49,833 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:49,834 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:49,834 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-28 04:58:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 04:58:49,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:49,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:49,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 04:58:49,835 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 04:58:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:49,836 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-28 04:58:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 04:58:49,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:49,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:49,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:49,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-28 04:58:49,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-28 04:58:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:49,838 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-28 04:58:49,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:49,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-28 04:58:49,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 04:58:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:58:49,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:49,866 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:49,881 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 04:58:50,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 04:58:50,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-28 04:58:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:50,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287057277] [2022-04-28 04:58:50,092 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:58:50,093 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:58:50,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-28 04:58:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:50,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174077333] [2022-04-28 04:58:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:50,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:50,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757929336] [2022-04-28 04:58:50,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:50,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:58:50,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:58:50,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:58:50,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:50,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:58:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:50,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:50,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-28 04:58:50,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#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(10, 2);~counter~0 := 0; {858#true} is VALID [2022-04-28 04:58:50,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-28 04:58:50,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-28 04:58:50,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-28 04:58:50,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 100);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 100);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:58:50,234 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:58:50,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:58:50,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-28 04:58:50,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-28 04:58:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:58:50,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:58:50,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:50,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174077333] [2022-04-28 04:58:50,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:50,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757929336] [2022-04-28 04:58:50,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757929336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:50,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:50,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:58:50,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:50,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287057277] [2022-04-28 04:58:50,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287057277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:50,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:50,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:58:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163629952] [2022-04-28 04:58:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 04:58:50,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:50,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:50,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:50,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:58:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:58:50,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:58:50,248 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:50,363 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 04:58:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:58:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 04:58:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 04:58:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 04:58:50,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 04:58:50,413 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 04:58:50,414 INFO L225 Difference]: With dead ends: 44 [2022-04-28 04:58:50,414 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 04:58:50,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:58:50,415 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:50,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 04:58:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-28 04:58:50,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:50,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:50,430 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:50,430 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:50,431 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 04:58:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 04:58:50,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:50,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:50,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-28 04:58:50,432 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-28 04:58:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:50,433 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 04:58:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 04:58:50,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:50,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:50,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:50,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-28 04:58:50,434 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-28 04:58:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:50,434 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-28 04:58:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:58:50,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-28 04:58:50,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 04:58:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:58:50,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:50,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:50,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:58:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:50,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-28 04:58:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51933504] [2022-04-28 04:58:50,680 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-28 04:58:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:50,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008752746] [2022-04-28 04:58:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:50,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:50,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892640522] [2022-04-28 04:58:50,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:50,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:58:50,692 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 04:58:50,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:58:50,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:50,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:58:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:50,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:50,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-28 04:58:50,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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(10, 2);~counter~0 := 0; {1157#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:50,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#(<= ~counter~0 0)} assume true; {1157#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:50,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#(<= ~counter~0 0)} {1149#true} #82#return; {1157#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:50,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#(<= ~counter~0 0)} call #t~ret4 := main(); {1157#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:50,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1157#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:50,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {1157#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:50,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {1173#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:50,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1173#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(<= ~counter~0 2)} assume !!(#t~post3 < 100);havoc #t~post3; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,877 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(<= ~counter~0 2)} ~cond := #in~cond; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(<= ~counter~0 2)} assume !(0 == ~cond); {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 2)} assume true; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#(<= ~counter~0 2)} {1183#(<= ~counter~0 2)} #78#return; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1183#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:50,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1211#(<= |main_#t~post3| 2)} is VALID [2022-04-28 04:58:50,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#(<= |main_#t~post3| 2)} assume !(#t~post3 < 100);havoc #t~post3; {1150#false} is VALID [2022-04-28 04:58:50,880 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-28 04:58:50,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-28 04:58:50,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-28 04:58:50,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-28 04:58:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:58:50,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:58:51,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-28 04:58:51,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-28 04:58:51,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-28 04:58:51,016 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-28 04:58:51,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(< |main_#t~post3| 100)} assume !(#t~post3 < 100);havoc #t~post3; {1150#false} is VALID [2022-04-28 04:58:51,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(< ~counter~0 100)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1239#(< |main_#t~post3| 100)} is VALID [2022-04-28 04:58:51,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1243#(< ~counter~0 100)} is VALID [2022-04-28 04:58:51,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#(< ~counter~0 100)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1243#(< ~counter~0 100)} is VALID [2022-04-28 04:58:51,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1243#(< ~counter~0 100)} #78#return; {1243#(< ~counter~0 100)} is VALID [2022-04-28 04:58:51,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-28 04:58:51,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-28 04:58:51,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-28 04:58:51,020 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-28 04:58:51,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(< ~counter~0 100)} assume !!(#t~post3 < 100);havoc #t~post3; {1243#(< ~counter~0 100)} is VALID [2022-04-28 04:58:51,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#(< ~counter~0 99)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1243#(< ~counter~0 100)} is VALID [2022-04-28 04:58:51,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1271#(< ~counter~0 99)} is VALID [2022-04-28 04:58:51,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(< ~counter~0 99)} assume !!(#t~post2 < 100);havoc #t~post2; {1271#(< ~counter~0 99)} is VALID [2022-04-28 04:58:51,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1281#(< ~counter~0 98)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1271#(< ~counter~0 99)} is VALID [2022-04-28 04:58:51,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1281#(< ~counter~0 98)} is VALID [2022-04-28 04:58:51,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#(< ~counter~0 98)} call #t~ret4 := main(); {1281#(< ~counter~0 98)} is VALID [2022-04-28 04:58:51,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#(< ~counter~0 98)} {1149#true} #82#return; {1281#(< ~counter~0 98)} is VALID [2022-04-28 04:58:51,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#(< ~counter~0 98)} assume true; {1281#(< ~counter~0 98)} is VALID [2022-04-28 04:58:51,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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(10, 2);~counter~0 := 0; {1281#(< ~counter~0 98)} is VALID [2022-04-28 04:58:51,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-28 04:58:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:58:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:51,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008752746] [2022-04-28 04:58:51,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:51,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892640522] [2022-04-28 04:58:51,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892640522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:58:51,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:58:51,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 04:58:51,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:51,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51933504] [2022-04-28 04:58:51,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51933504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:51,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:51,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:58:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647809822] [2022-04-28 04:58:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:51,038 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 04:58:51,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:51,038 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:58:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:58:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:58:51,052 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,147 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 04:58:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:58:51,148 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 04:58:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:51,148 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:58:51,149 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 04:58:51,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 04:58:51,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:51,189 INFO L225 Difference]: With dead ends: 57 [2022-04-28 04:58:51,189 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 04:58:51,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:58:51,189 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:51,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 04:58:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-04-28 04:58:51,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:51,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:51,222 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:51,222 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,223 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-28 04:58:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-28 04:58:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:51,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:51,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-28 04:58:51,224 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 50 states. [2022-04-28 04:58:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,225 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-28 04:58:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-28 04:58:51,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:51,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:51,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:51,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 04:58:51,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-04-28 04:58:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:51,226 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 04:58:51,226 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 04:58:51,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 04:58:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:58:51,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:51,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:51,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:58:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:51,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-28 04:58:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:51,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215364817] [2022-04-28 04:58:51,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 2 times [2022-04-28 04:58:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:51,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330097833] [2022-04-28 04:58:51,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:51,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:51,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090420573] [2022-04-28 04:58:51,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:51,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:51,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:51,490 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 04:58:51,509 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 04:58:51,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:58:51,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:51,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:58:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:51,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:51,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1606#true} is VALID [2022-04-28 04:58:51,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#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(10, 2);~counter~0 := 0; {1606#true} is VALID [2022-04-28 04:58:51,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-28 04:58:51,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #82#return; {1606#true} is VALID [2022-04-28 04:58:51,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret4 := main(); {1606#true} is VALID [2022-04-28 04:58:51,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 100);havoc #t~post2; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 100);havoc #t~post3; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1606#true} is VALID [2022-04-28 04:58:51,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#true} ~cond := #in~cond; {1606#true} is VALID [2022-04-28 04:58:51,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#true} assume !(0 == ~cond); {1606#true} is VALID [2022-04-28 04:58:51,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-28 04:58:51,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1606#true} {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1607#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {1607#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1607#false} assume !!(#t~post3 < 100);havoc #t~post3; {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L272 TraceCheckUtils]: 20: Hoare triple {1607#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {1607#false} ~cond := #in~cond; {1607#false} is VALID [2022-04-28 04:58:51,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {1607#false} assume 0 == ~cond; {1607#false} is VALID [2022-04-28 04:58:51,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-28 04:58:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:58:51,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:58:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330097833] [2022-04-28 04:58:51,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090420573] [2022-04-28 04:58:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090420573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:51,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:58:51,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215364817] [2022-04-28 04:58:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215364817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:51,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:51,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:58:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251220183] [2022-04-28 04:58:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 04:58:51,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:51,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:51,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:58:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:58:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:58:51,612 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,662 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-28 04:58:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:58:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-28 04:58:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 04:58:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 04:58:51,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-28 04:58:51,703 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 04:58:51,705 INFO L225 Difference]: With dead ends: 65 [2022-04-28 04:58:51,705 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:58:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:58:51,706 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:51,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:58:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 04:58:51,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:51,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:51,722 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:51,722 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,724 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 04:58:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 04:58:51,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:51,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:51,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-28 04:58:51,724 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-28 04:58:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:51,725 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 04:58:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 04:58:51,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:51,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:51,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:51,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-28 04:58:51,726 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-28 04:58:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:51,726 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-28 04:58:51,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:51,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-28 04:58:51,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 04:58:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:58:51,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:51,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:51,774 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 04:58:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:51,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-28 04:58:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:51,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870423943] [2022-04-28 04:58:51,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:58:51,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:58:51,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-28 04:58:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:51,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756949223] [2022-04-28 04:58:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:51,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:51,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902771890] [2022-04-28 04:58:51,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:51,989 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 04:58:52,026 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 04:58:52,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:58:52,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:52,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:58:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:52,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:52,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-28 04:58:52,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#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(10, 2);~counter~0 := 0; {1950#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1950#(<= ~counter~0 0)} assume true; {1950#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1950#(<= ~counter~0 0)} {1942#true} #82#return; {1950#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {1950#(<= ~counter~0 0)} call #t~ret4 := main(); {1950#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {1950#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1950#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {1950#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {1966#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1966#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1976#(<= |main_#t~post2| 1)} is VALID [2022-04-28 04:58:52,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {1976#(<= |main_#t~post2| 1)} assume !(#t~post2 < 100);havoc #t~post2; {1943#false} is VALID [2022-04-28 04:58:52,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 100);havoc #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,138 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#false} assume !(0 == ~cond); {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {1943#false} assume true; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1943#false} {1943#false} #78#return; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 100);havoc #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-28 04:58:52,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-28 04:58:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:58:52,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:58:52,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#false} assume !false; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {1943#false} assume 0 == ~cond; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {1943#false} ~cond := #in~cond; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {1943#false} assume !(#t~post3 < 100);havoc #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1942#true} {1943#false} #78#return; {1943#false} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} assume true; {1942#true} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#true} assume !(0 == ~cond); {1942#true} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} ~cond := #in~cond; {1942#true} is VALID [2022-04-28 04:58:52,257 INFO L272 TraceCheckUtils]: 13: Hoare triple {1943#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#true} is VALID [2022-04-28 04:58:52,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1943#false} assume !!(#t~post3 < 100);havoc #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1943#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1943#false} is VALID [2022-04-28 04:58:52,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(< |main_#t~post2| 100)} assume !(#t~post2 < 100);havoc #t~post2; {1943#false} is VALID [2022-04-28 04:58:52,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#(< ~counter~0 100)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2070#(< |main_#t~post2| 100)} is VALID [2022-04-28 04:58:52,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#(< ~counter~0 100)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2074#(< ~counter~0 100)} is VALID [2022-04-28 04:58:52,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#(< ~counter~0 100)} assume !!(#t~post2 < 100);havoc #t~post2; {2074#(< ~counter~0 100)} is VALID [2022-04-28 04:58:52,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {2084#(< ~counter~0 99)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2074#(< ~counter~0 100)} is VALID [2022-04-28 04:58:52,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {2084#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2084#(< ~counter~0 99)} is VALID [2022-04-28 04:58:52,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {2084#(< ~counter~0 99)} call #t~ret4 := main(); {2084#(< ~counter~0 99)} is VALID [2022-04-28 04:58:52,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2084#(< ~counter~0 99)} {1942#true} #82#return; {2084#(< ~counter~0 99)} is VALID [2022-04-28 04:58:52,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2084#(< ~counter~0 99)} assume true; {2084#(< ~counter~0 99)} is VALID [2022-04-28 04:58:52,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#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(10, 2);~counter~0 := 0; {2084#(< ~counter~0 99)} is VALID [2022-04-28 04:58:52,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {1942#true} call ULTIMATE.init(); {1942#true} is VALID [2022-04-28 04:58:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:58:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756949223] [2022-04-28 04:58:52,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902771890] [2022-04-28 04:58:52,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902771890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:58:52,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:58:52,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 04:58:52,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870423943] [2022-04-28 04:58:52,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870423943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:52,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:52,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:58:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501622429] [2022-04-28 04:58:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:52,269 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-28 04:58:52,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:52,269 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:52,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:52,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:58:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:58:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:58:52,283 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:52,352 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-28 04:58:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:58:52,352 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-28 04:58:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:52,352 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-28 04:58:52,353 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-28 04:58:52,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-28 04:58:52,381 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 04:58:52,382 INFO L225 Difference]: With dead ends: 56 [2022-04-28 04:58:52,382 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:58:52,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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 04:58:52,383 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:52,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:58:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 04:58:52,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:52,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:52,401 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:52,401 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:52,402 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 04:58:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 04:58:52,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:52,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:52,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-28 04:58:52,402 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-28 04:58:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:52,403 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 04:58:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 04:58:52,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:52,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:52,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:52,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:58:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-28 04:58:52,404 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-28 04:58:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:52,404 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-28 04:58:52,405 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:52,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-28 04:58:52,437 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 04:58:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 04:58:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:58:52,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:52,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:52,457 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 04:58:52,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:52,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-28 04:58:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:52,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722807466] [2022-04-28 04:58:52,661 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:58:52,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:58:52,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-28 04:58:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:52,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88962768] [2022-04-28 04:58:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:52,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:52,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821008105] [2022-04-28 04:58:52,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:52,671 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 04:58:52,671 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 04:58:52,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:58:52,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:58:52,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:58:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:58:52,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:58:52,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-28 04:58:52,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(10, 2);~counter~0 := 0; {2367#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#(<= ~counter~0 0)} assume true; {2367#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#(<= ~counter~0 0)} {2359#true} #82#return; {2367#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#(<= ~counter~0 0)} call #t~ret4 := main(); {2367#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {2367#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2367#(<= ~counter~0 0)} is VALID [2022-04-28 04:58:52,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {2367#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {2383#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {2383#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {2383#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2383#(<= ~counter~0 1)} is VALID [2022-04-28 04:58:52,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {2383#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:52,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {2393#(<= ~counter~0 2)} assume !!(#t~post2 < 100);havoc #t~post2; {2393#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:52,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {2393#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2393#(<= ~counter~0 2)} is VALID [2022-04-28 04:58:52,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {2393#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {2403#(<= ~counter~0 3)} assume !!(#t~post3 < 100);havoc #t~post3; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,861 INFO L272 TraceCheckUtils]: 14: Hoare triple {2403#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {2403#(<= ~counter~0 3)} ~cond := #in~cond; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {2403#(<= ~counter~0 3)} assume !(0 == ~cond); {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {2403#(<= ~counter~0 3)} assume true; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,862 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2403#(<= ~counter~0 3)} {2403#(<= ~counter~0 3)} #78#return; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {2403#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {2403#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2403#(<= ~counter~0 3)} is VALID [2022-04-28 04:58:52,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {2403#(<= ~counter~0 3)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2431#(<= |main_#t~post3| 3)} is VALID [2022-04-28 04:58:52,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2431#(<= |main_#t~post3| 3)} assume !(#t~post3 < 100);havoc #t~post3; {2360#false} is VALID [2022-04-28 04:58:52,863 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-28 04:58:52,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-28 04:58:52,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-28 04:58:52,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-28 04:58:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:58:52,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:58:53,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-28 04:58:53,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {2360#false} assume 0 == ~cond; {2360#false} is VALID [2022-04-28 04:58:53,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {2360#false} ~cond := #in~cond; {2360#false} is VALID [2022-04-28 04:58:53,027 INFO L272 TraceCheckUtils]: 23: Hoare triple {2360#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2360#false} is VALID [2022-04-28 04:58:53,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {2459#(< |main_#t~post3| 100)} assume !(#t~post3 < 100);havoc #t~post3; {2360#false} is VALID [2022-04-28 04:58:53,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {2463#(< ~counter~0 100)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2459#(< |main_#t~post3| 100)} is VALID [2022-04-28 04:58:53,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {2463#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2463#(< ~counter~0 100)} is VALID [2022-04-28 04:58:53,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {2463#(< ~counter~0 100)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2463#(< ~counter~0 100)} is VALID [2022-04-28 04:58:53,029 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2359#true} {2463#(< ~counter~0 100)} #78#return; {2463#(< ~counter~0 100)} is VALID [2022-04-28 04:58:53,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-28 04:58:53,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-28 04:58:53,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-28 04:58:53,029 INFO L272 TraceCheckUtils]: 14: Hoare triple {2463#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2359#true} is VALID [2022-04-28 04:58:53,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {2463#(< ~counter~0 100)} assume !!(#t~post3 < 100);havoc #t~post3; {2463#(< ~counter~0 100)} is VALID [2022-04-28 04:58:53,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(< ~counter~0 99)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2463#(< ~counter~0 100)} is VALID [2022-04-28 04:58:53,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2491#(< ~counter~0 99)} is VALID [2022-04-28 04:58:53,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {2491#(< ~counter~0 99)} assume !!(#t~post2 < 100);havoc #t~post2; {2491#(< ~counter~0 99)} is VALID [2022-04-28 04:58:53,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#(< ~counter~0 98)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2491#(< ~counter~0 99)} is VALID [2022-04-28 04:58:53,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(< ~counter~0 98)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2501#(< ~counter~0 98)} is VALID [2022-04-28 04:58:53,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(< ~counter~0 98)} assume !!(#t~post2 < 100);havoc #t~post2; {2501#(< ~counter~0 98)} is VALID [2022-04-28 04:58:53,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#(< ~counter~0 97)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2501#(< ~counter~0 98)} is VALID [2022-04-28 04:58:53,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {2511#(< ~counter~0 97)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2511#(< ~counter~0 97)} is VALID [2022-04-28 04:58:53,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {2511#(< ~counter~0 97)} call #t~ret4 := main(); {2511#(< ~counter~0 97)} is VALID [2022-04-28 04:58:53,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2511#(< ~counter~0 97)} {2359#true} #82#return; {2511#(< ~counter~0 97)} is VALID [2022-04-28 04:58:53,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {2511#(< ~counter~0 97)} assume true; {2511#(< ~counter~0 97)} is VALID [2022-04-28 04:58:53,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(10, 2);~counter~0 := 0; {2511#(< ~counter~0 97)} is VALID [2022-04-28 04:58:53,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-28 04:58:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:58:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:58:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88962768] [2022-04-28 04:58:53,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:58:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821008105] [2022-04-28 04:58:53,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821008105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:58:53,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:58:53,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 04:58:53,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:58:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722807466] [2022-04-28 04:58:53,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722807466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:58:53,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:58:53,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:58:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843348832] [2022-04-28 04:58:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:58:53,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-28 04:58:53,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:58:53,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:53,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:53,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:58:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:53,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:58:53,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:58:53,067 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:53,169 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 04:58:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:58:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-28 04:58:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:58:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 04:58:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 04:58:53,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-28 04:58:53,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:53,208 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:58:53,208 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 04:58:53,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:58:53,209 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:58:53,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:58:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 04:58:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-04-28 04:58:53,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:58:53,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:53,241 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:53,242 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:53,243 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-28 04:58:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-28 04:58:53,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:53,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:53,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-28 04:58:53,243 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 53 states. [2022-04-28 04:58:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:58:53,245 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-28 04:58:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-28 04:58:53,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:58:53,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:58:53,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:58:53,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:58:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:58:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-28 04:58:53,246 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 27 [2022-04-28 04:58:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:58:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-28 04:58:53,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:58:53,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 55 transitions. [2022-04-28 04:58:53,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:58:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 04:58:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:58:53,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:58:53,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:58:53,315 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 04:58:53,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:53,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:58:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:58:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-28 04:58:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:58:53,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [671743073] [2022-04-28 04:58:53,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:58:53,505 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:58:53,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:58:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 2 times [2022-04-28 04:58:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:58:53,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863984190] [2022-04-28 04:58:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:58:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:58:53,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:58:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922928463] [2022-04-28 04:58:53,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:58:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:58:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:58:53,515 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 04:58:53,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process