/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/divbin_unwindbound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:12:52,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:12:52,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:12:52,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:12:52,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:12:52,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:12:52,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:12:52,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:12:52,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:12:52,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:12:52,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:12:52,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:12:52,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:12:52,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:12:52,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:12:52,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:12:52,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:12:52,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:12:52,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:12:52,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:12:52,524 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:12:52,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:12:52,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:12:52,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:12:52,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:12:52,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:12:52,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:12:52,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:12:52,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:12:52,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:12:52,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:12:52,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:12:52,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:12:52,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:12:52,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:12:52,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:12:52,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:12:52,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:12:52,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:12:52,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:12:52,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:12:52,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:12:52,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:12:52,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:12:52,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:12:52,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:12:52,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:12:52,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:12:52,557 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:12:52,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:12:52,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:12:52,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:12:52,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:12:52,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:12:52,558 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:12:52,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:12:52,559 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:12:52,559 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-15 08:12:52,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:12:52,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:12:52,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:12:52,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:12:52,799 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:12:52,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-15 08:12:52,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee6af42/b8fdb77c04214706af9693375c0acb11/FLAG9710ada75 [2022-04-15 08:12:53,218 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:12:53,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-15 08:12:53,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee6af42/b8fdb77c04214706af9693375c0acb11/FLAG9710ada75 [2022-04-15 08:12:53,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ee6af42/b8fdb77c04214706af9693375c0acb11 [2022-04-15 08:12:53,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:12:53,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:12:53,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:12:53,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:12:53,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:12:53,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a61ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53, skipping insertion in model container [2022-04-15 08:12:53,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:12:53,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:12:53,840 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/divbin_unwindbound20.i[950,963] [2022-04-15 08:12:53,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:12:53,862 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:12:53,874 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/divbin_unwindbound20.i[950,963] [2022-04-15 08:12:53,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:12:53,891 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:12:53,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53 WrapperNode [2022-04-15 08:12:53,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:12:53,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:12:53,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:12:53,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:12:53,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:12:53,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:12:53,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:12:53,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:12:53,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (1/1) ... [2022-04-15 08:12:53,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:12:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:53,981 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-15 08:12:54,006 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-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:12:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:12:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:12:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:12:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 08:12:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 08:12:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:12:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:12:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:12:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:12:54,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:12:54,112 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:12:54,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:12:54,247 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:12:54,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:12:54,254 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:12:54,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:12:54 BoogieIcfgContainer [2022-04-15 08:12:54,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:12:54,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:12:54,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:12:54,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:12:54,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:12:53" (1/3) ... [2022-04-15 08:12:54,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510b62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:12:54, skipping insertion in model container [2022-04-15 08:12:54,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:12:53" (2/3) ... [2022-04-15 08:12:54,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510b62c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:12:54, skipping insertion in model container [2022-04-15 08:12:54,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:12:54" (3/3) ... [2022-04-15 08:12:54,276 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2022-04-15 08:12:54,280 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:12:54,280 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:12:54,331 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:12:54,343 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:12:54,343 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:12:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:12:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:12:54,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:54,384 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:54,385 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-15 08:12:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75487049] [2022-04-15 08:12:54,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-15 08:12:54,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:54,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839335265] [2022-04-15 08:12:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:12:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:54,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 08:12:54,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 08:12:54,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 08:12:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 08:12:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:54,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:54,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:54,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:54,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 08:12:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 08:12:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:54,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:54,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:54,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:54,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 08:12:54,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:12:54,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 08:12:54,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 08:12:54,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 08:12:54,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-15 08:12:54,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#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 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-15 08:12:54,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-15 08:12:54,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:54,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:54,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:54,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 08:12:54,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-15 08:12:54,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 08:12:54,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 08:12:54,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 08:12:54,718 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 08:12:54,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-15 08:12:54,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 08:12:54,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 08:12:54,719 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-15 08:12:54,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 08:12:54,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 08:12:54,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 08:12:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839335265] [2022-04-15 08:12:54,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839335265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:54,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:54,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:54,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75487049] [2022-04-15 08:12:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75487049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:54,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:54,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:12:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540503968] [2022-04-15 08:12:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:12:54,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:54,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:54,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:54,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:12:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:12:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:54,815 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,000 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 08:12:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:12:55,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:12:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 08:12:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 08:12:55,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-15 08:12:55,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:55,182 INFO L225 Difference]: With dead ends: 60 [2022-04-15 08:12:55,182 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 08:12:55,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:12:55,189 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:55,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 08:12:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 08:12:55,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:55,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,228 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,228 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,232 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 08:12:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 08:12:55,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:55,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:55,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 08:12:55,234 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 08:12:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,241 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 08:12:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 08:12:55,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:55,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:55,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:55,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 08:12:55,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-15 08:12:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:55,254 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 08:12:55,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 08:12:55,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 08:12:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 08:12:55,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:55,305 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:12:55,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:12:55,306 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-15 08:12:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:55,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495646011] [2022-04-15 08:12:55,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:55,311 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-15 08:12:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7938945] [2022-04-15 08:12:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:55,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:55,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563060925] [2022-04-15 08:12:55,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:55,367 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-15 08:12:55,384 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-15 08:12:55,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:55,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:55,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:12:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:55,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:55,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-15 08:12:55,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~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 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:55,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-15 08:12:55,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 20);havoc #t~post3; {287#false} is VALID [2022-04-15 08:12:55,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-15 08:12:55,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 20);havoc #t~post4; {287#false} is VALID [2022-04-15 08:12:55,693 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-15 08:12:55,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 08:12:55,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 08:12:55,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 08:12:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:55,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:55,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7938945] [2022-04-15 08:12:55,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:55,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563060925] [2022-04-15 08:12:55,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563060925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:55,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:12:55,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:55,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495646011] [2022-04-15 08:12:55,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495646011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:55,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:55,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:12:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53958030] [2022-04-15 08:12:55,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 08:12:55,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:55,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:55,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:12:55,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:12:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:12:55,724 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,817 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 08:12:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:12:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 08:12:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 08:12:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 08:12:55,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 08:12:55,869 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-15 08:12:55,872 INFO L225 Difference]: With dead ends: 42 [2022-04-15 08:12:55,872 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 08:12:55,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:12:55,875 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:55,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 08:12:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 08:12:55,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:55,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,893 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,893 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,895 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 08:12:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:55,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:55,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:55,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 08:12:55,896 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 08:12:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:55,898 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 08:12:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:55,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:55,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:55,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 08:12:55,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-15 08:12:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:55,901 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 08:12:55,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:55,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 08:12:55,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 08:12:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:12:55,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:55,936 INFO L499 BasicCegarLoop]: 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-15 08:12:55,964 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-15 08:12:56,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:56,152 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-15 08:12:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574728028] [2022-04-15 08:12:56,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-15 08:12:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:56,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120320742] [2022-04-15 08:12:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:56,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:56,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137415416] [2022-04-15 08:12:56,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:56,178 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-15 08:12:56,213 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-15 08:12:56,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:56,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:56,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:12:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:56,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:56,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 08:12:56,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~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 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,424 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,425 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 08:12:56,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:56,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:56,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-15 08:12:56,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-15 08:12:56,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 20);havoc #t~post4; {569#false} is VALID [2022-04-15 08:12:56,429 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-15 08:12:56,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 08:12:56,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 08:12:56,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 08:12:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:56,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120320742] [2022-04-15 08:12:56,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137415416] [2022-04-15 08:12:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137415416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:56,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:12:56,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:56,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574728028] [2022-04-15 08:12:56,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574728028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:12:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152539401] [2022-04-15 08:12:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 08:12:56,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:56,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:56,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:56,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:12:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:12:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:12:56,451 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:56,570 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:12:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:12:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 08:12:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 08:12:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 08:12:56,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 08:12:56,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:56,617 INFO L225 Difference]: With dead ends: 41 [2022-04-15 08:12:56,617 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 08:12:56,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-15 08:12:56,619 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:56,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:12:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 08:12:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 08:12:56,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:12:56,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:56,632 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:56,633 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:56,635 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 08:12:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 08:12:56,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:56,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:56,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 08:12:56,636 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 08:12:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:56,638 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 08:12:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 08:12:56,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:12:56,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:12:56,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:12:56,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:12:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:12:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-15 08:12:56,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-15 08:12:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:12:56,641 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-15 08:12:56,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:12:56,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-15 08:12:56,682 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-15 08:12:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 08:12:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:12:56,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:12:56,684 INFO L499 BasicCegarLoop]: 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-15 08:12:56,710 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-15 08:12:56,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 08:12:56,885 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:12:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:12:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-15 08:12:56,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:56,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089378914] [2022-04-15 08:12:56,886 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:12:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-15 08:12:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:12:56,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085541340] [2022-04-15 08:12:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:12:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:12:56,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:12:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578031976] [2022-04-15 08:12:56,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:12:56,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:12:56,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:12:56,911 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-15 08:12:56,912 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-15 08:12:56,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:12:56,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:12:56,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 08:12:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:12:56,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:12:57,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 08:12:57,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-15 08:12:57,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:57,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-15 08:12:57,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-15 08:12:57,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#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 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-15 08:12:57,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-15 08:12:57,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 08:12:57,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 08:12:57,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:57,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-15 08:12:57,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-15 08:12:57,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 08:12:57,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 08:12:57,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 08:12:57,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-15 08:12:57,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:57,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:57,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 20);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:12:57,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (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-15 08:12:57,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (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-15 08:12:57,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 20);havoc #t~post4; {929#(and (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-15 08:12:57,504 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (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)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:12:57,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:12:57,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-15 08:12:57,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 08:12:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:12:57,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:12:57,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:12:57,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085541340] [2022-04-15 08:12:57,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:12:57,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578031976] [2022-04-15 08:12:57,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578031976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:57,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:57,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:57,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:12:57,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089378914] [2022-04-15 08:12:57,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089378914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:12:57,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:12:57,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:12:57,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873707468] [2022-04-15 08:12:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:12:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 08:12:57,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:12:57,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:57,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:57,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:12:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:12:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:12:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:12:57,530 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:59,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 08:12:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:12:59,904 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 08:12:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:12:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 08:12:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:12:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 08:12:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:12:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 08:12:59,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-15 08:12:59,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:12:59,989 INFO L225 Difference]: With dead ends: 50 [2022-04-15 08:12:59,989 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 08:12:59,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-15 08:12:59,990 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:12:59,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 08:12:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 08:13:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-15 08:13:00,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:13:00,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:00,024 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:00,024 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:00,026 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 08:13:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 08:13:00,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:00,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:00,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 08:13:00,028 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 08:13:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:00,030 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 08:13:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 08:13:00,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:00,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:00,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:13:00,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:13:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 08:13:00,033 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-15 08:13:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:13:00,033 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 08:13:00,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:13:00,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 08:13:00,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 08:13:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 08:13:00,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:13:00,120 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:13:00,149 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-15 08:13:00,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:00,334 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:13:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:13:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-15 08:13:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457716308] [2022-04-15 08:13:00,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:13:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-15 08:13:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:13:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465461811] [2022-04-15 08:13:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:13:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:13:00,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:13:00,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755391301] [2022-04-15 08:13:00,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:13:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:13:00,359 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-15 08:13:00,366 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-15 08:13:00,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:13:00,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:13:00,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:13:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:13:00,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:13:00,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 08:13:00,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(<= ~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 := #t~nondet2;havoc #t~nondet2; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,682 INFO L272 TraceCheckUtils]: 11: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:00,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:00,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:00,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1278#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:00,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 20);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,688 INFO L272 TraceCheckUtils]: 22: Hoare triple {1288#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,689 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {1288#(<= ~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); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {1288#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:00,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1316#(<= |main_#t~post4| 2)} is VALID [2022-04-15 08:13:00,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 20);havoc #t~post4; {1222#false} is VALID [2022-04-15 08:13:00,692 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 08:13:00,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 08:13:00,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 08:13:00,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 08:13:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:13:00,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:13:00,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 08:13:00,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 08:13:00,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 08:13:00,962 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 08:13:00,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 20)} assume !(#t~post4 < 20);havoc #t~post4; {1222#false} is VALID [2022-04-15 08:13:00,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 20)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 20)} is VALID [2022-04-15 08:13:00,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 20)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 20)} is VALID [2022-04-15 08:13:00,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 20)} 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); {1348#(< ~counter~0 20)} is VALID [2022-04-15 08:13:00,966 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 20)} #85#return; {1348#(< ~counter~0 20)} is VALID [2022-04-15 08:13:00,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:13:00,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:13:00,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:13:00,966 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:13:00,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 20)} assume !!(#t~post4 < 20);havoc #t~post4; {1348#(< ~counter~0 20)} is VALID [2022-04-15 08:13:00,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 19)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 20)} is VALID [2022-04-15 08:13:00,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 19)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 19)} is VALID [2022-04-15 08:13:00,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 19)} assume !!(#t~post3 < 20);havoc #t~post3; {1376#(< ~counter~0 19)} is VALID [2022-04-15 08:13:00,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(< ~counter~0 18)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 19)} is VALID [2022-04-15 08:13:00,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1386#(< ~counter~0 18)} #83#return; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:13:00,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:13:00,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:13:00,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {1386#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:13:00,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1386#(< ~counter~0 18)} #81#return; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 08:13:00,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 08:13:00,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 08:13:00,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-15 08:13:00,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#(< ~counter~0 18)} call #t~ret5 := main(); {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#(< ~counter~0 18)} {1221#true} #89#return; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(< ~counter~0 18)} assume true; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1386#(< ~counter~0 18)} is VALID [2022-04-15 08:13:00,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 08:13:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:13:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:13:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465461811] [2022-04-15 08:13:00,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:13:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755391301] [2022-04-15 08:13:00,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755391301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:13:00,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:13:00,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 08:13:00,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:13:00,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457716308] [2022-04-15 08:13:00,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457716308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:13:00,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:13:00,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:13:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964744182] [2022-04-15 08:13:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:13:00,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 08:13:00,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:13:00,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:01,006 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-15 08:13:01,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:13:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:13:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:13:01,008 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:01,232 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-15 08:13:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:13:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 08:13:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:13:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 08:13:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 08:13:01,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-15 08:13:01,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:01,296 INFO L225 Difference]: With dead ends: 64 [2022-04-15 08:13:01,296 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 08:13:01,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 08:13:01,297 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:13:01,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:13:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 08:13:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-15 08:13:01,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:13:01,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:01,345 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:01,345 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:01,348 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 08:13:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 08:13:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:01,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:01,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 08:13:01,349 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 08:13:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:01,352 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 08:13:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 08:13:01,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:01,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:01,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:13:01,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:13:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-15 08:13:01,359 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-15 08:13:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:13:01,360 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-15 08:13:01,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:01,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-15 08:13:01,429 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-15 08:13:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-15 08:13:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 08:13:01,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:13:01,432 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:13:01,459 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-15 08:13:01,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:01,648 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:13:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:13:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-15 08:13:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284230565] [2022-04-15 08:13:01,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:13:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-15 08:13:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:13:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771365026] [2022-04-15 08:13:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:13:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:13:01,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:13:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087439999] [2022-04-15 08:13:01,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:13:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:13:01,672 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-15 08:13:01,673 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-15 08:13:01,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:13:01,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:13:01,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:13:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:13:01,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:13:01,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {1786#true} call ULTIMATE.init(); {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#true} {1786#true} #89#return; {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#true} call #t~ret5 := main(); {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#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 := #t~nondet2;havoc #t~nondet2; {1786#true} is VALID [2022-04-15 08:13:01,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1786#true} {1786#true} #81#return; {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L272 TraceCheckUtils]: 11: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 08:13:01,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1786#true} {1786#true} #83#return; {1786#true} is VALID [2022-04-15 08:13:01,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 20);havoc #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 20);havoc #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,821 INFO L272 TraceCheckUtils]: 22: Hoare triple {1839#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#true} is VALID [2022-04-15 08:13:01,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 08:13:01,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 08:13:01,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 08:13:01,823 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1786#true} {1839#(= main_~B~0 main_~b~0)} #85#return; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 08:13:01,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#(= main_~B~0 main_~b~0)} 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); {1787#false} is VALID [2022-04-15 08:13:01,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {1787#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1787#false} is VALID [2022-04-15 08:13:01,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#false} assume !!(#t~post4 < 20);havoc #t~post4; {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L272 TraceCheckUtils]: 31: Hoare triple {1787#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#false} ~cond := #in~cond; {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {1787#false} assume 0 == ~cond; {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {1787#false} assume !false; {1787#false} is VALID [2022-04-15 08:13:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:13:01,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:13:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:13:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771365026] [2022-04-15 08:13:01,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:13:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087439999] [2022-04-15 08:13:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087439999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:13:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:13:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:13:01,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:13:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284230565] [2022-04-15 08:13:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284230565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:13:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:13:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:13:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273846351] [2022-04-15 08:13:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:13:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 08:13:01,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:13:01,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:13:01,854 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-15 08:13:01,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:13:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:13:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:13:01,855 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:13:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:02,003 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-15 08:13:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:13:02,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 08:13:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:13:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:13:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 08:13:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:13:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 08:13:02,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 08:13:02,058 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-15 08:13:02,059 INFO L225 Difference]: With dead ends: 72 [2022-04-15 08:13:02,060 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 08:13:02,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-15 08:13:02,061 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:13:02,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:13:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 08:13:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 08:13:02,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:13:02,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:02,091 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:02,092 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:02,094 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 08:13:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:13:02,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:02,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:02,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 08:13:02,095 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 08:13:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:02,097 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 08:13:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:13:02,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:02,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:02,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:13:02,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:13:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-15 08:13:02,099 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-15 08:13:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:13:02,100 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-15 08:13:02,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 08:13:02,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-15 08:13:02,162 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-15 08:13:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 08:13:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 08:13:02,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:13:02,163 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:13:02,190 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-15 08:13:02,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:02,387 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:13:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:13:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-15 08:13:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:02,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837749977] [2022-04-15 08:13:02,388 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:13:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-15 08:13:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:13:02,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272881199] [2022-04-15 08:13:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:13:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:13:02,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:13:02,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692929802] [2022-04-15 08:13:02,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:13:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:13:02,409 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-15 08:13:02,413 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-15 08:13:02,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:13:02,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:13:02,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:13:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:13:02,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:13:02,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 08:13:02,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#(<= ~counter~0 0)} {2197#true} #89#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#(<= ~counter~0 0)} call #t~ret5 := main(); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#(<= ~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 := #t~nondet2;havoc #t~nondet2; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #81#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #83#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {2205#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:02,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {2205#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:02,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:02,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:02,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2264#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:13:02,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {2264#(<= |main_#t~post3| 1)} assume !(#t~post3 < 20);havoc #t~post3; {2198#false} is VALID [2022-04-15 08:13:02,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#false} assume !(0 == ~cond); {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2198#false} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#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); {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 08:13:02,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 08:13:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 08:13:02,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:13:02,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 08:13:02,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 08:13:02,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 08:13:02,898 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 08:13:02,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#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); {2198#false} is VALID [2022-04-15 08:13:02,899 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 08:13:02,899 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 08:13:02,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(< |main_#t~post3| 20)} assume !(#t~post3 < 20);havoc #t~post3; {2198#false} is VALID [2022-04-15 08:13:02,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {2362#(< ~counter~0 20)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2358#(< |main_#t~post3| 20)} is VALID [2022-04-15 08:13:02,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {2362#(< ~counter~0 20)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2362#(< ~counter~0 20)} is VALID [2022-04-15 08:13:02,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {2362#(< ~counter~0 20)} assume !!(#t~post3 < 20);havoc #t~post3; {2362#(< ~counter~0 20)} is VALID [2022-04-15 08:13:02,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(< ~counter~0 19)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2362#(< ~counter~0 20)} is VALID [2022-04-15 08:13:02,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(< ~counter~0 19)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2197#true} {2372#(< ~counter~0 19)} #83#return; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 08:13:02,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 08:13:02,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 08:13:02,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {2372#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-15 08:13:02,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2372#(< ~counter~0 19)} #81#return; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 08:13:02,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 08:13:02,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 08:13:02,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {2372#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2197#true} is VALID [2022-04-15 08:13:02,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#(< ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {2372#(< ~counter~0 19)} call #t~ret5 := main(); {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2372#(< ~counter~0 19)} {2197#true} #89#return; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#(< ~counter~0 19)} assume true; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2372#(< ~counter~0 19)} is VALID [2022-04-15 08:13:02,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 08:13:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 08:13:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:13:02,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272881199] [2022-04-15 08:13:02,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:13:02,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692929802] [2022-04-15 08:13:02,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692929802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:13:02,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:13:02,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 08:13:02,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:13:02,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837749977] [2022-04-15 08:13:02,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837749977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:13:02,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:13:02,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:13:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043082038] [2022-04-15 08:13:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:13:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 08:13:02,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:13:02,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:02,936 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-15 08:13:02,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:13:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:13:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 08:13:02,937 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:03,072 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 08:13:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:13:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 08:13:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:13:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 08:13:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 08:13:03,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 08:13:03,121 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-15 08:13:03,123 INFO L225 Difference]: With dead ends: 63 [2022-04-15 08:13:03,123 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 08:13:03,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 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-15 08:13:03,124 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:13:03,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:13:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 08:13:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 08:13:03,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:13:03,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:03,163 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:03,163 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:03,165 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 08:13:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:13:03,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:03,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:03,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 08:13:03,165 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 08:13:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:03,167 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 08:13:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:13:03,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:03,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:03,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:13:03,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:13:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 08:13:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-15 08:13:03,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-15 08:13:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:13:03,169 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-15 08:13:03,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:03,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-15 08:13:03,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 08:13:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 08:13:03,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:13:03,229 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:13:03,251 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-15 08:13:03,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:03,436 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:13:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:13:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-15 08:13:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:03,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1455865835] [2022-04-15 08:13:03,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:13:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-15 08:13:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:13:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257262262] [2022-04-15 08:13:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:13:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:13:03,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:13:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693342670] [2022-04-15 08:13:03,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:13:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:13:03,457 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-15 08:13:03,463 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-15 08:13:03,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:13:03,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:13:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:13:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:13:03,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:13:03,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 08:13:03,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#(<= ~counter~0 0)} {2722#true} #89#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#(<= ~counter~0 0)} call #t~ret5 := main(); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#(<= ~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 := #t~nondet2;havoc #t~nondet2; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #81#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #83#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 08:13:03,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {2730#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:03,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:03,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 08:13:03,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:03,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {2789#(<= ~counter~0 2)} assume !!(#t~post3 < 20);havoc #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:03,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {2789#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2789#(<= ~counter~0 2)} is VALID [2022-04-15 08:13:03,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {2789#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= ~counter~0 3)} assume !!(#t~post4 < 20);havoc #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,808 INFO L272 TraceCheckUtils]: 25: Hoare triple {2799#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {2799#(<= ~counter~0 3)} ~cond := #in~cond; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {2799#(<= ~counter~0 3)} assume !(0 == ~cond); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {2799#(<= ~counter~0 3)} assume true; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,810 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2799#(<= ~counter~0 3)} {2799#(<= ~counter~0 3)} #85#return; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {2799#(<= ~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); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 08:13:03,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {2799#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2827#(<= |main_#t~post4| 3)} is VALID [2022-04-15 08:13:03,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {2827#(<= |main_#t~post4| 3)} assume !(#t~post4 < 20);havoc #t~post4; {2723#false} is VALID [2022-04-15 08:13:03,812 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 08:13:03,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 08:13:03,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 08:13:03,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 08:13:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:13:03,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:13:04,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 08:13:04,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 08:13:04,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 08:13:04,119 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 08:13:04,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {2855#(< |main_#t~post4| 20)} assume !(#t~post4 < 20);havoc #t~post4; {2723#false} is VALID [2022-04-15 08:13:04,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {2859#(< ~counter~0 20)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2855#(< |main_#t~post4| 20)} is VALID [2022-04-15 08:13:04,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {2859#(< ~counter~0 20)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2859#(< ~counter~0 20)} is VALID [2022-04-15 08:13:04,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {2859#(< ~counter~0 20)} 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); {2859#(< ~counter~0 20)} is VALID [2022-04-15 08:13:04,120 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2722#true} {2859#(< ~counter~0 20)} #85#return; {2859#(< ~counter~0 20)} is VALID [2022-04-15 08:13:04,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 08:13:04,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 08:13:04,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 08:13:04,121 INFO L272 TraceCheckUtils]: 25: Hoare triple {2859#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#true} is VALID [2022-04-15 08:13:04,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(< ~counter~0 20)} assume !!(#t~post4 < 20);havoc #t~post4; {2859#(< ~counter~0 20)} is VALID [2022-04-15 08:13:04,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(< ~counter~0 19)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2859#(< ~counter~0 20)} is VALID [2022-04-15 08:13:04,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {2887#(< ~counter~0 19)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2887#(< ~counter~0 19)} is VALID [2022-04-15 08:13:04,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {2887#(< ~counter~0 19)} assume !!(#t~post3 < 20);havoc #t~post3; {2887#(< ~counter~0 19)} is VALID [2022-04-15 08:13:04,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2897#(< ~counter~0 18)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2887#(< ~counter~0 19)} is VALID [2022-04-15 08:13:04,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {2897#(< ~counter~0 18)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2897#(< ~counter~0 18)} is VALID [2022-04-15 08:13:04,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {2897#(< ~counter~0 18)} assume !!(#t~post3 < 20);havoc #t~post3; {2897#(< ~counter~0 18)} is VALID [2022-04-15 08:13:04,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(< ~counter~0 17)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2897#(< ~counter~0 18)} is VALID [2022-04-15 08:13:04,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(< ~counter~0 17)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2722#true} {2907#(< ~counter~0 17)} #83#return; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 08:13:04,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 08:13:04,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 08:13:04,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {2907#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2722#true} is VALID [2022-04-15 08:13:04,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2722#true} {2907#(< ~counter~0 17)} #81#return; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 08:13:04,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 08:13:04,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 08:13:04,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {2907#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2722#true} is VALID [2022-04-15 08:13:04,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {2907#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {2907#(< ~counter~0 17)} call #t~ret5 := main(); {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2907#(< ~counter~0 17)} {2722#true} #89#return; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2907#(< ~counter~0 17)} assume true; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2907#(< ~counter~0 17)} is VALID [2022-04-15 08:13:04,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 08:13:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:13:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:13:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257262262] [2022-04-15 08:13:04,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:13:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693342670] [2022-04-15 08:13:04,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693342670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:13:04,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:13:04,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:13:04,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:13:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1455865835] [2022-04-15 08:13:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1455865835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:13:04,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:13:04,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:13:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204251613] [2022-04-15 08:13:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:13:04,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 08:13:04,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:13:04,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:04,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:04,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:13:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:13:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:13:04,167 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:04,394 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-15 08:13:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:13:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 08:13:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:13:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 08:13:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 08:13:04,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-15 08:13:04,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:04,465 INFO L225 Difference]: With dead ends: 67 [2022-04-15 08:13:04,465 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 08:13:04,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:13:04,466 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:13:04,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:13:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 08:13:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-15 08:13:04,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:13:04,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:04,514 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:04,514 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:04,516 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 08:13:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 08:13:04,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:04,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:04,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 08:13:04,517 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 08:13:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:13:04,519 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 08:13:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 08:13:04,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:13:04,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:13:04,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:13:04,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:13:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:13:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 08:13:04,521 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-15 08:13:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:13:04,521 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 08:13:04,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:13:04,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-15 08:13:04,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:13:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 08:13:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 08:13:04,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:13:04,596 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:13:04,623 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-15 08:13:04,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:04,797 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:13:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:13:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-15 08:13:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:13:04,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43923436] [2022-04-15 08:13:04,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:13:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-15 08:13:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:13:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542584634] [2022-04-15 08:13:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:13:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:13:04,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:13:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245984369] [2022-04-15 08:13:04,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:13:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:13:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:13:04,815 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-15 08:13:04,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process