/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_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:15:56,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:15:56,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:15:56,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:15:56,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:15:56,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:15:56,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:15:56,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:15:56,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:15:56,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:15:56,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:15:56,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:15:56,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:15:56,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:15:56,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:15:56,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:15:56,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:15:56,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:15:56,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:15:56,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:15:56,057 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:15:56,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:15:56,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:15:56,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:15:56,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:15:56,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:15:56,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:15:56,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:15:56,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:15:56,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:15:56,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:15:56,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:15:56,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:15:56,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:15:56,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:15:56,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:15:56,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:15:56,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:15:56,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:15:56,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:15:56,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:15:56,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:15:56,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:15:56,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:15:56,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:15:56,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:15:56,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:15:56,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:15:56,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:15:56,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:15:56,082 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 05:15:56,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:15:56,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:15:56,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:15:56,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:15:56,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:15:56,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-08 05:15:56,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc55c7538/1828d6eb8c5b488989d333cfb8d7ccd7/FLAGc8c6678b3 [2022-04-08 05:15:56,682 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:15:56,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-08 05:15:56,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc55c7538/1828d6eb8c5b488989d333cfb8d7ccd7/FLAGc8c6678b3 [2022-04-08 05:15:56,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc55c7538/1828d6eb8c5b488989d333cfb8d7ccd7 [2022-04-08 05:15:56,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:15:56,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:15:56,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:15:56,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:15:56,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:15:56,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321ab9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56, skipping insertion in model container [2022-04-08 05:15:56,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:15:56,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:15:56,870 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_unwindbound5.i[950,963] [2022-04-08 05:15:56,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:15:56,901 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:15:56,916 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_unwindbound5.i[950,963] [2022-04-08 05:15:56,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:15:56,945 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:15:56,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56 WrapperNode [2022-04-08 05:15:56,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:15:56,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:15:56,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:15:56,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:15:56,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:15:56,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:15:56,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:15:56,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:15:56,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (1/1) ... [2022-04-08 05:15:56,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:15:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:15:57,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 05:15:57,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 05:15:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:15:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:15:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:15:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:15:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:15:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:15:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:15:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:15:57,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:15:57,095 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:15:57,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:15:57,239 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:15:57,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:15:57,245 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:15:57,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:15:57 BoogieIcfgContainer [2022-04-08 05:15:57,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:15:57,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:15:57,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:15:57,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:15:57,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:15:56" (1/3) ... [2022-04-08 05:15:57,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c6c44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:15:57, skipping insertion in model container [2022-04-08 05:15:57,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:15:56" (2/3) ... [2022-04-08 05:15:57,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c6c44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:15:57, skipping insertion in model container [2022-04-08 05:15:57,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:15:57" (3/3) ... [2022-04-08 05:15:57,253 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2022-04-08 05:15:57,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:15:57,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:15:57,317 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:15:57,322 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 05:15:57,322 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:15:57,340 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-08 05:15:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:15:57,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:15:57,345 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-08 05:15:57,346 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:15:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:15:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-08 05:15:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:57,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135132634] [2022-04-08 05:15:57,380 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:15:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-08 05:15:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:15:57,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603370358] [2022-04-08 05:15:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:15:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:15:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:15:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:57,574 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-08 05:15:57,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:15:57,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:15:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:15:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:57,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:15:57,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:15:57,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:15:57,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:15:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 05:15:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:57,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:15:57,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:15:57,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:15:57,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:15:57,599 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-08 05:15:57,599 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-08 05:15:57,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:15:57,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:15:57,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-08 05:15:57,600 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-08 05:15:57,600 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-08 05:15:57,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:15:57,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:15:57,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:15:57,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:15:57,601 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-08 05:15:57,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:15:57,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:15:57,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:15:57,602 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:15:57,603 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-08 05:15:57,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:15:57,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:15:57,603 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-08 05:15:57,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 05:15:57,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 05:15:57,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 05:15:57,604 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-08 05:15:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:15:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603370358] [2022-04-08 05:15:57,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603370358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:57,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:15:57,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:15:57,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135132634] [2022-04-08 05:15:57,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135132634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:57,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:57,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:15:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211302307] [2022-04-08 05:15:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:15:57,612 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-08 05:15:57,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:15:57,615 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-08 05:15:57,644 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-08 05:15:57,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:15:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:15:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:15:57,660 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-08 05:15:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:57,796 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-08 05:15:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:15:57,797 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-08 05:15:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:15:57,798 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-08 05:15:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:15:57,806 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-08 05:15:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:15:57,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-08 05:15:57,890 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-08 05:15:57,900 INFO L225 Difference]: With dead ends: 60 [2022-04-08 05:15:57,900 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 05:15:57,902 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-08 05:15:57,907 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-08 05:15:57,909 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-08 05:15:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 05:15:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 05:15:57,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:15:57,955 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-08 05:15:57,956 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-08 05:15:57,956 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-08 05:15:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:57,962 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:15:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:15:57,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:15:57,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:15:57,963 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-08 05:15:57,963 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-08 05:15:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:57,966 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:15:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:15:57,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:15:57,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:15:57,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:15:57,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:15:57,967 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-08 05:15:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 05:15:57,970 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-08 05:15:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:15:57,970 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 05:15:57,970 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-08 05:15:57,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 05:15:58,041 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-08 05:15:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 05:15:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 05:15:58,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:15:58,043 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-08 05:15:58,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:15:58,043 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:15:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:15:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-08 05:15:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:58,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500401184] [2022-04-08 05:15:58,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:15:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-08 05:15:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:15:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145653573] [2022-04-08 05:15:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:15:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:15:58,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:15:58,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461509093] [2022-04-08 05:15:58,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:15:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:15:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:15:58,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:15:58,099 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-08 05:15:58,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:15:58,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:15:58,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:15:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:58,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:15:58,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 05:15:58,354 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-08 05:15:58,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,356 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-08 05:15:58,356 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-08 05:15:58,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,360 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-08 05:15:58,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:58,373 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-08 05:15:58,374 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-08 05:15:58,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 5);havoc #t~post3; {287#false} is VALID [2022-04-08 05:15:58,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-08 05:15:58,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 5);havoc #t~post4; {287#false} is VALID [2022-04-08 05:15:58,376 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-08 05:15:58,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 05:15:58,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 05:15:58,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 05:15:58,377 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-08 05:15:58,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:15:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:15:58,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145653573] [2022-04-08 05:15:58,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:15:58,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461509093] [2022-04-08 05:15:58,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461509093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:58,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:58,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:15:58,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:15:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500401184] [2022-04-08 05:15:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500401184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:58,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:58,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:15:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389568493] [2022-04-08 05:15:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:15:58,382 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-08 05:15:58,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:15:58,383 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-08 05:15:58,397 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-08 05:15:58,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:15:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:15:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:15:58,399 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-08 05:15:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:58,465 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-08 05:15:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:15:58,466 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-08 05:15:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:15:58,467 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-08 05:15:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:15:58,471 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-08 05:15:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:15:58,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-08 05:15:58,512 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-08 05:15:58,515 INFO L225 Difference]: With dead ends: 42 [2022-04-08 05:15:58,515 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 05:15:58,517 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-08 05:15:58,519 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-08 05:15:58,523 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-08 05:15:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 05:15:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 05:15:58,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:15:58,543 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-08 05:15:58,543 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-08 05:15:58,543 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-08 05:15:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:58,545 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:15:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:15:58,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:15:58,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:15:58,546 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-08 05:15:58,546 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-08 05:15:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:15:58,548 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:15:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:15:58,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:15:58,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:15:58,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:15:58,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:15:58,548 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-08 05:15:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 05:15:58,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-08 05:15:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:15:58,550 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 05:15:58,550 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-08 05:15:58,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 05:15:58,583 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-08 05:15:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:15:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:15:58,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:15:58,584 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-08 05:15:58,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 05:15:58,799 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-08 05:15:58,800 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:15:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:15:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-08 05:15:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:58,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621740848] [2022-04-08 05:15:58,801 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:15:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-08 05:15:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:15:58,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969493863] [2022-04-08 05:15:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:15:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:15:58,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:15:58,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030231670] [2022-04-08 05:15:58,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:15:58,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:15:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:15:58,826 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-08 05:15:58,828 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-08 05:15:58,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:15:58,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:15:58,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:15:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:15:58,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:15:59,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 05:15:59,042 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-08 05:15:59,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,044 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-08 05:15:59,044 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-08 05:15:59,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,046 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-08 05:15:59,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:15:59,048 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-08 05:15:59,049 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-08 05:15:59,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-08 05:15:59,049 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-08 05:15:59,050 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-08 05:15:59,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 5);havoc #t~post4; {569#false} is VALID [2022-04-08 05:15:59,050 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-08 05:15:59,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 05:15:59,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 05:15:59,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 05:15:59,051 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-08 05:15:59,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:15:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:15:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969493863] [2022-04-08 05:15:59,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:15:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030231670] [2022-04-08 05:15:59,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030231670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:59,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:59,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:15:59,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:15:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621740848] [2022-04-08 05:15:59,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621740848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:15:59,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:15:59,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:15:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784716017] [2022-04-08 05:15:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:15:59,053 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-08 05:15:59,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:15:59,054 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-08 05:15:59,071 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-08 05:15:59,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:15:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:15:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:15:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:15:59,072 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-08 05:16:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:01,237 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 05:16:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:16:01,237 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-08 05:16:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:01,238 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-08 05:16:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:16:01,239 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-08 05:16:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:16:01,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-08 05:16:01,327 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-08 05:16:01,328 INFO L225 Difference]: With dead ends: 41 [2022-04-08 05:16:01,328 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 05:16:01,329 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-08 05:16:01,329 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-08 05:16:01,330 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-08 05:16:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 05:16:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 05:16:01,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:01,340 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-08 05:16:01,341 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-08 05:16:01,341 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-08 05:16:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:01,343 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:16:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:16:01,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:01,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:01,343 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-08 05:16:01,343 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-08 05:16:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:01,345 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:16:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:16:01,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:01,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:01,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:01,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:01,345 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-08 05:16:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-08 05:16:01,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-08 05:16:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:01,347 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-08 05:16:01,347 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-08 05:16:01,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-08 05:16:01,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:16:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 05:16:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:16:01,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:01,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, 1, 1, 1] [2022-04-08 05:16:01,401 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-08 05:16:01,601 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-08 05:16:01,601 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-08 05:16:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:01,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018951813] [2022-04-08 05:16:01,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-08 05:16:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:01,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564853069] [2022-04-08 05:16:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:01,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992828773] [2022-04-08 05:16:01,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:01,617 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-08 05:16:01,618 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-08 05:16:01,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:16:01,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:16:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 05:16:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:16:01,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:16:02,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-08 05:16:02,195 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-08 05:16:02,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:16:02,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-08 05:16:02,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-08 05:16:02,196 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-08 05:16:02,196 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-08 05:16:02,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:16:02,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:16:02,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:16:02,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-08 05:16:02,197 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-08 05:16:02,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:16:02,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:16:02,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:16:02,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-08 05:16:02,198 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-08 05:16:02,198 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-08 05:16:02,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:16:02,201 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-08 05:16:02,201 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-08 05:16:02,202 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 < 5);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-08 05:16:02,203 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-08 05:16:02,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:16:02,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-08 05:16:02,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-08 05:16:02,204 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-08 05:16:02,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:16:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:16:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564853069] [2022-04-08 05:16:02,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:16:02,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992828773] [2022-04-08 05:16:02,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992828773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:02,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:02,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:16:02,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:16:02,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018951813] [2022-04-08 05:16:02,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018951813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:02,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:02,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:16:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528254482] [2022-04-08 05:16:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:16:02,206 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-08 05:16:02,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:16:02,206 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-08 05:16:02,222 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-08 05:16:02,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:16:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:02,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:16:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:16:02,224 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-08 05:16:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:02,417 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 05:16:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:16:02,417 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-08 05:16:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:02,417 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-08 05:16:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:16:02,419 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-08 05:16:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:16:02,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 05:16:02,468 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-08 05:16:02,469 INFO L225 Difference]: With dead ends: 50 [2022-04-08 05:16:02,469 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:16:02,469 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-08 05:16:02,470 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.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, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:16:02,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:16:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:16:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-08 05:16:02,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:02,489 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-08 05:16:02,489 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-08 05:16:02,489 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-08 05:16:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:02,491 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:16:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:16:02,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:02,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:02,491 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-08 05:16:02,491 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-08 05:16:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:02,493 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:16:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:16:02,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:02,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:02,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:02,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:02,494 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-08 05:16:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 05:16:02,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-08 05:16:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:02,495 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 05:16:02,495 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-08 05:16:02,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 05:16:02,534 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-08 05:16:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 05:16:02,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:16:02,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:02,535 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-08 05:16:02,554 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-08 05:16:02,751 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-08 05:16:02,752 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-08 05:16:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:02,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104349769] [2022-04-08 05:16:02,753 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-08 05:16:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:02,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307197288] [2022-04-08 05:16:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:02,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:02,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425267939] [2022-04-08 05:16:02,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:02,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:02,783 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-08 05:16:02,791 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-08 05:16:02,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:16:02,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:16:02,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:16:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:16:02,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:16:02,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 05:16:02,983 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-08 05:16:02,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:02,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:02,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:02,985 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-08 05:16:02,986 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-08 05:16:02,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:02,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,005 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-08 05:16:03,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,006 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:03,006 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-08 05:16:03,007 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-08 05:16:03,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:03,007 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-08 05:16:03,008 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-08 05:16:03,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 5);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,009 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-08 05:16:03,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,010 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,010 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-08 05:16:03,010 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-08 05:16:03,011 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-08 05:16:03,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 5);havoc #t~post4; {1222#false} is VALID [2022-04-08 05:16:03,011 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-08 05:16:03,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 05:16:03,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 05:16:03,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 05:16:03,012 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-08 05:16:03,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:16:03,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-08 05:16:03,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-08 05:16:03,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-08 05:16:03,200 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-08 05:16:03,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {1222#false} is VALID [2022-04-08 05:16:03,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 5)} is VALID [2022-04-08 05:16:03,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 5)} is VALID [2022-04-08 05:16:03,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 5)} 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 5)} is VALID [2022-04-08 05:16:03,203 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 5)} #85#return; {1348#(< ~counter~0 5)} is VALID [2022-04-08 05:16:03,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:16:03,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:16:03,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:16:03,204 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-08 05:16:03,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 5)} assume !!(#t~post4 < 5);havoc #t~post4; {1348#(< ~counter~0 5)} is VALID [2022-04-08 05:16:03,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 4)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 5)} is VALID [2022-04-08 05:16:03,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 4)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 4)} is VALID [2022-04-08 05:16:03,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 4)} assume !!(#t~post3 < 5);havoc #t~post3; {1376#(< ~counter~0 4)} is VALID [2022-04-08 05:16:03,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {1288#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 4)} is VALID [2022-04-08 05:16:03,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {1288#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,206 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1288#(<= ~counter~0 2)} #83#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:16:03,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:16:03,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:16:03,206 INFO L272 TraceCheckUtils]: 11: Hoare triple {1288#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-08 05:16:03,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1288#(<= ~counter~0 2)} #81#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-08 05:16:03,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-08 05:16:03,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-08 05:16:03,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {1288#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-08 05:16:03,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {1288#(<= ~counter~0 2)} 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; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {1288#(<= ~counter~0 2)} call #t~ret5 := main(); {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1288#(<= ~counter~0 2)} {1221#true} #89#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,209 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; {1288#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:03,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-08 05:16:03,209 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-08 05:16:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:16:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307197288] [2022-04-08 05:16:03,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:16:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425267939] [2022-04-08 05:16:03,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425267939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:16:03,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:16:03,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 05:16:03,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:16:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104349769] [2022-04-08 05:16:03,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104349769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:03,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:03,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:16:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623884584] [2022-04-08 05:16:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:16:03,210 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-08 05:16:03,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:16:03,211 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-08 05:16:03,229 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-08 05:16:03,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:16:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:16:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:16:03,230 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-08 05:16:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:03,383 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 05:16:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:16:03,383 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-08 05:16:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:03,384 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-08 05:16:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 05:16:03,385 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-08 05:16:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-08 05:16:03,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-08 05:16:03,429 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-08 05:16:03,430 INFO L225 Difference]: With dead ends: 64 [2022-04-08 05:16:03,431 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 05:16:03,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:16:03,431 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-08 05:16:03,432 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-08 05:16:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 05:16:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-08 05:16:03,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:03,468 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-08 05:16:03,468 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-08 05:16:03,468 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-08 05:16:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:03,470 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 05:16:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 05:16:03,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:03,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:03,471 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-08 05:16:03,471 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-08 05:16:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:03,472 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-08 05:16:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-08 05:16:03,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:03,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:03,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:03,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:03,473 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-08 05:16:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-08 05:16:03,475 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-08 05:16:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:03,475 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-08 05:16:03,475 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-08 05:16:03,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-08 05:16:03,531 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-08 05:16:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-08 05:16:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:16:03,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:03,532 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-08 05:16:03,565 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-08 05:16:03,749 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-08 05:16:03,749 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-08 05:16:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988148232] [2022-04-08 05:16:03,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-08 05:16:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014831887] [2022-04-08 05:16:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:03,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901935058] [2022-04-08 05:16:03,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:03,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:03,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:03,770 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-08 05:16:03,771 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-08 05:16:03,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:16:03,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:16:03,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 05:16:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:16:03,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:16:03,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {1785#true} call ULTIMATE.init(); {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {1785#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; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1785#true} {1785#true} #89#return; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {1785#true} call #t~ret5 := main(); {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1785#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; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {1785#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1785#true} {1785#true} #81#return; {1785#true} is VALID [2022-04-08 05:16:03,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {1785#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1785#true} is VALID [2022-04-08 05:16:03,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 05:16:03,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 05:16:03,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 05:16:03,883 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1785#true} {1785#true} #83#return; {1785#true} is VALID [2022-04-08 05:16:03,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {1785#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {1838#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 5);havoc #t~post3; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 5);havoc #t~post4; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,888 INFO L272 TraceCheckUtils]: 22: Hoare triple {1838#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1785#true} is VALID [2022-04-08 05:16:03,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {1785#true} ~cond := #in~cond; {1785#true} is VALID [2022-04-08 05:16:03,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {1785#true} assume !(0 == ~cond); {1785#true} is VALID [2022-04-08 05:16:03,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1785#true} assume true; {1785#true} is VALID [2022-04-08 05:16:03,889 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1785#true} {1838#(= main_~B~0 main_~b~0)} #85#return; {1838#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {1838#(= 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); {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {1786#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {1786#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {1786#false} assume !!(#t~post4 < 5);havoc #t~post4; {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L272 TraceCheckUtils]: 31: Hoare triple {1786#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {1786#false} ~cond := #in~cond; {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {1786#false} assume 0 == ~cond; {1786#false} is VALID [2022-04-08 05:16:03,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2022-04-08 05:16:03,890 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-08 05:16:03,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:16:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:16:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014831887] [2022-04-08 05:16:03,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:16:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901935058] [2022-04-08 05:16:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901935058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:03,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:03,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:16:03,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:16:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988148232] [2022-04-08 05:16:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988148232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:03,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:03,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:16:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807473095] [2022-04-08 05:16:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:16:03,891 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-08 05:16:03,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:16:03,891 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-08 05:16:03,910 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-08 05:16:03,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:16:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:16:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:16:03,911 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-08 05:16:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:04,008 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-08 05:16:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:16:04,008 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-08 05:16:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:04,008 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-08 05:16:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:16:04,011 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-08 05:16:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:16:04,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 05:16:04,054 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-08 05:16:04,054 INFO L225 Difference]: With dead ends: 72 [2022-04-08 05:16:04,055 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 05:16:04,055 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-08 05:16:04,055 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-08 05:16:04,056 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-08 05:16:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 05:16:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 05:16:04,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:04,075 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-08 05:16:04,075 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-08 05:16:04,075 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-08 05:16:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:04,076 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 05:16:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:16:04,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:04,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:04,077 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-08 05:16:04,077 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-08 05:16:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:04,078 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 05:16:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:16:04,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:04,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:04,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:04,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:04,078 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-08 05:16:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 05:16:04,079 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-08 05:16:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:04,079 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 05:16:04,079 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-08 05:16:04,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 05:16:04,118 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-08 05:16:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 05:16:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 05:16:04,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:04,118 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-08 05:16:04,138 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-08 05:16:04,331 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-08 05:16:04,331 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-08 05:16:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966658484] [2022-04-08 05:16:04,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-08 05:16:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435761155] [2022-04-08 05:16:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:04,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:04,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089628082] [2022-04-08 05:16:04,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:04,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:04,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:04,362 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-08 05:16:04,363 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-08 05:16:04,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:16:04,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:16:04,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:16:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:16:04,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:16:04,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {2196#true} call ULTIMATE.init(); {2196#true} is VALID [2022-04-08 05:16:04,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#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; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2204#(<= ~counter~0 0)} {2196#true} #89#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {2204#(<= ~counter~0 0)} call #t~ret5 := main(); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {2204#(<= ~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; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {2204#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {2204#(<= ~counter~0 0)} ~cond := #in~cond; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2204#(<= ~counter~0 0)} assume !(0 == ~cond); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2204#(<= ~counter~0 0)} {2204#(<= ~counter~0 0)} #81#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {2204#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {2204#(<= ~counter~0 0)} ~cond := #in~cond; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2204#(<= ~counter~0 0)} assume !(0 == ~cond); {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2204#(<= ~counter~0 0)} assume true; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,546 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2204#(<= ~counter~0 0)} {2204#(<= ~counter~0 0)} #83#return; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {2204#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2204#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:04,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {2204#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:04,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2253#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:04,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {2253#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2253#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:04,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {2253#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2263#(<= |main_#t~post3| 1)} is VALID [2022-04-08 05:16:04,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {2197#false} is VALID [2022-04-08 05:16:04,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {2197#false} assume !!(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L272 TraceCheckUtils]: 24: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#false} assume !(0 == ~cond); {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#false} assume true; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#false} {2197#false} #85#return; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {2197#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); {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {2197#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {2197#false} assume !(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L272 TraceCheckUtils]: 33: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {2197#false} assume 0 == ~cond; {2197#false} is VALID [2022-04-08 05:16:04,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {2197#false} assume !false; {2197#false} is VALID [2022-04-08 05:16:04,550 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-08 05:16:04,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:16:04,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {2197#false} assume !false; {2197#false} is VALID [2022-04-08 05:16:04,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {2197#false} assume 0 == ~cond; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {2197#false} ~cond := #in~cond; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L272 TraceCheckUtils]: 33: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {2197#false} assume !(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {2197#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {2197#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); {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2196#true} {2197#false} #85#return; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 05:16:04,722 INFO L272 TraceCheckUtils]: 24: Hoare triple {2197#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2196#true} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {2197#false} assume !!(#t~post4 < 5);havoc #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2197#false} is VALID [2022-04-08 05:16:04,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {2357#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {2197#false} is VALID [2022-04-08 05:16:04,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2357#(< |main_#t~post3| 5)} is VALID [2022-04-08 05:16:04,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2361#(< ~counter~0 5)} is VALID [2022-04-08 05:16:04,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {2361#(< ~counter~0 5)} is VALID [2022-04-08 05:16:04,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {2371#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2361#(< ~counter~0 5)} is VALID [2022-04-08 05:16:04,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {2371#(< ~counter~0 4)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,726 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2196#true} {2371#(< ~counter~0 4)} #83#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 05:16:04,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 05:16:04,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 05:16:04,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {2371#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2196#true} is VALID [2022-04-08 05:16:04,727 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2196#true} {2371#(< ~counter~0 4)} #81#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {2196#true} assume true; {2196#true} is VALID [2022-04-08 05:16:04,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {2196#true} assume !(0 == ~cond); {2196#true} is VALID [2022-04-08 05:16:04,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2196#true} ~cond := #in~cond; {2196#true} is VALID [2022-04-08 05:16:04,727 INFO L272 TraceCheckUtils]: 6: Hoare triple {2371#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2196#true} is VALID [2022-04-08 05:16:04,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {2371#(< ~counter~0 4)} 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; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {2371#(< ~counter~0 4)} call #t~ret5 := main(); {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2371#(< ~counter~0 4)} {2196#true} #89#return; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#(< ~counter~0 4)} assume true; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#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; {2371#(< ~counter~0 4)} is VALID [2022-04-08 05:16:04,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2196#true} call ULTIMATE.init(); {2196#true} is VALID [2022-04-08 05:16:04,729 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-08 05:16:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:16:04,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435761155] [2022-04-08 05:16:04,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:16:04,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089628082] [2022-04-08 05:16:04,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089628082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:16:04,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:16:04,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 05:16:04,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:16:04,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966658484] [2022-04-08 05:16:04,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966658484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:04,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:04,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:16:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247444088] [2022-04-08 05:16:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:16:04,730 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-08 05:16:04,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:16:04,731 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-08 05:16:04,749 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-08 05:16:04,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:16:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:16:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:16:04,750 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-08 05:16:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:06,941 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 05:16:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:16:06,942 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-08 05:16:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:06,942 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-08 05:16:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:16:06,943 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-08 05:16:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:16:06,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-08 05:16:06,980 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-08 05:16:06,981 INFO L225 Difference]: With dead ends: 63 [2022-04-08 05:16:06,981 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 05:16:06,982 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-08 05:16:06,982 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 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-08 05:16:06,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:16:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 05:16:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 05:16:07,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:07,008 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-08 05:16:07,008 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-08 05:16:07,008 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-08 05:16:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:07,010 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 05:16:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:16:07,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:07,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:07,010 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-08 05:16:07,010 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-08 05:16:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:07,011 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 05:16:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:16:07,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:07,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:07,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:07,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:07,012 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-08 05:16:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-08 05:16:07,013 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-08 05:16:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:07,013 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-08 05:16:07,013 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-08 05:16:07,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-08 05:16:07,054 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-08 05:16:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 05:16:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:16:07,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:07,054 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-08 05:16:07,070 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-08 05:16:07,262 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-08 05:16:07,262 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-08 05:16:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:07,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466850609] [2022-04-08 05:16:07,263 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-08 05:16:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:07,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7881534] [2022-04-08 05:16:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:07,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:07,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463920556] [2022-04-08 05:16:07,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:07,287 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-08 05:16:07,288 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-08 05:16:07,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:16:07,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:16:07,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:16:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:16:07,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:16:07,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {2721#true} call ULTIMATE.init(); {2721#true} is VALID [2022-04-08 05:16:07,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#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; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2729#(<= ~counter~0 0)} {2721#true} #89#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {2729#(<= ~counter~0 0)} call #t~ret5 := main(); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2729#(<= ~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; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,562 INFO L272 TraceCheckUtils]: 6: Hoare triple {2729#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {2729#(<= ~counter~0 0)} ~cond := #in~cond; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {2729#(<= ~counter~0 0)} assume !(0 == ~cond); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2729#(<= ~counter~0 0)} {2729#(<= ~counter~0 0)} #81#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,563 INFO L272 TraceCheckUtils]: 11: Hoare triple {2729#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {2729#(<= ~counter~0 0)} ~cond := #in~cond; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2729#(<= ~counter~0 0)} assume !(0 == ~cond); {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {2729#(<= ~counter~0 0)} assume true; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,565 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2729#(<= ~counter~0 0)} {2729#(<= ~counter~0 0)} #83#return; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {2729#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2729#(<= ~counter~0 0)} is VALID [2022-04-08 05:16:07,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {2729#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {2778#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {2778#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {2778#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {2788#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {2788#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {2788#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {2798#(<= ~counter~0 3)} assume !!(#t~post4 < 5);havoc #t~post4; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,569 INFO L272 TraceCheckUtils]: 25: Hoare triple {2798#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {2798#(<= ~counter~0 3)} ~cond := #in~cond; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {2798#(<= ~counter~0 3)} assume !(0 == ~cond); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {2798#(<= ~counter~0 3)} assume true; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,570 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2798#(<= ~counter~0 3)} {2798#(<= ~counter~0 3)} #85#return; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {2798#(<= ~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); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {2798#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {2798#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2826#(<= |main_#t~post4| 3)} is VALID [2022-04-08 05:16:07,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {2826#(<= |main_#t~post4| 3)} assume !(#t~post4 < 5);havoc #t~post4; {2722#false} is VALID [2022-04-08 05:16:07,571 INFO L272 TraceCheckUtils]: 34: Hoare triple {2722#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#false} is VALID [2022-04-08 05:16:07,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#false} ~cond := #in~cond; {2722#false} is VALID [2022-04-08 05:16:07,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {2722#false} assume 0 == ~cond; {2722#false} is VALID [2022-04-08 05:16:07,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {2722#false} assume !false; {2722#false} is VALID [2022-04-08 05:16:07,572 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-08 05:16:07,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:16:07,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2722#false} assume !false; {2722#false} is VALID [2022-04-08 05:16:07,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {2722#false} assume 0 == ~cond; {2722#false} is VALID [2022-04-08 05:16:07,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#false} ~cond := #in~cond; {2722#false} is VALID [2022-04-08 05:16:07,769 INFO L272 TraceCheckUtils]: 34: Hoare triple {2722#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#false} is VALID [2022-04-08 05:16:07,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {2854#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {2722#false} is VALID [2022-04-08 05:16:07,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {2858#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2854#(< |main_#t~post4| 5)} is VALID [2022-04-08 05:16:07,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {2858#(< ~counter~0 5)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2858#(< ~counter~0 5)} is VALID [2022-04-08 05:16:07,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {2858#(< ~counter~0 5)} 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); {2858#(< ~counter~0 5)} is VALID [2022-04-08 05:16:07,773 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2721#true} {2858#(< ~counter~0 5)} #85#return; {2858#(< ~counter~0 5)} is VALID [2022-04-08 05:16:07,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 05:16:07,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 05:16:07,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 05:16:07,773 INFO L272 TraceCheckUtils]: 25: Hoare triple {2858#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2721#true} is VALID [2022-04-08 05:16:07,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {2858#(< ~counter~0 5)} assume !!(#t~post4 < 5);havoc #t~post4; {2858#(< ~counter~0 5)} is VALID [2022-04-08 05:16:07,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {2798#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2858#(< ~counter~0 5)} is VALID [2022-04-08 05:16:07,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {2798#(<= ~counter~0 3)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {2798#(<= ~counter~0 3)} assume !!(#t~post3 < 5);havoc #t~post3; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {2788#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2798#(<= ~counter~0 3)} is VALID [2022-04-08 05:16:07,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {2788#(<= ~counter~0 2)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {2788#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {2778#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2788#(<= ~counter~0 2)} is VALID [2022-04-08 05:16:07,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {2778#(<= ~counter~0 1)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2721#true} {2778#(<= ~counter~0 1)} #83#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 05:16:07,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 05:16:07,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 05:16:07,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {2778#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2721#true} is VALID [2022-04-08 05:16:07,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2721#true} {2778#(<= ~counter~0 1)} #81#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {2721#true} assume true; {2721#true} is VALID [2022-04-08 05:16:07,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {2721#true} assume !(0 == ~cond); {2721#true} is VALID [2022-04-08 05:16:07,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {2721#true} ~cond := #in~cond; {2721#true} is VALID [2022-04-08 05:16:07,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {2778#(<= ~counter~0 1)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2721#true} is VALID [2022-04-08 05:16:07,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {2778#(<= ~counter~0 1)} 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; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {2778#(<= ~counter~0 1)} call #t~ret5 := main(); {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2778#(<= ~counter~0 1)} {2721#true} #89#return; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {2778#(<= ~counter~0 1)} assume true; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#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; {2778#(<= ~counter~0 1)} is VALID [2022-04-08 05:16:07,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {2721#true} call ULTIMATE.init(); {2721#true} is VALID [2022-04-08 05:16:07,780 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-08 05:16:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:16:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7881534] [2022-04-08 05:16:07,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:16:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463920556] [2022-04-08 05:16:07,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463920556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:16:07,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:16:07,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 05:16:07,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:16:07,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466850609] [2022-04-08 05:16:07,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466850609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:16:07,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:16:07,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:16:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928500624] [2022-04-08 05:16:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:16:07,782 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-08 05:16:07,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:16:07,782 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-08 05:16:07,823 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-08 05:16:07,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:16:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:16:07,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:16:07,823 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-08 05:16:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:07,989 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 05:16:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:16:07,989 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-08 05:16:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:16:07,990 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-08 05:16:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 05:16:07,991 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-08 05:16:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-08 05:16:07,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-08 05:16:08,035 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-08 05:16:08,036 INFO L225 Difference]: With dead ends: 67 [2022-04-08 05:16:08,036 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 05:16:08,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:16:08,037 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:16:08,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 103 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:16:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 05:16:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-08 05:16:08,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:16:08,069 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-08 05:16:08,069 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-08 05:16:08,070 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-08 05:16:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:08,071 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 05:16:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 05:16:08,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:08,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:08,071 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-08 05:16:08,072 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-08 05:16:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:16:08,073 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 05:16:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 05:16:08,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:16:08,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:16:08,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:16:08,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:16:08,073 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-08 05:16:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 05:16:08,075 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-08 05:16:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:16:08,075 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 05:16:08,076 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-08 05:16:08,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 05:16:08,146 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-08 05:16:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 05:16:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:16:08,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:16:08,147 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-08 05:16:08,165 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-08 05:16:08,347 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-08 05:16:08,347 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:16:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:16:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-08 05:16:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:16:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201967356] [2022-04-08 05:16:08,348 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:16:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-08 05:16:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:16:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695750081] [2022-04-08 05:16:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:16:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:16:08,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:16:08,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606003747] [2022-04-08 05:16:08,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:16:08,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:16:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:16:08,370 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-08 05:16:08,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process