/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/divbin2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:14:20,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:14:20,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:14:20,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:14:20,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:14:20,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:14:20,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:14:20,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:14:20,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:14:20,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:14:20,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:14:20,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:14:20,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:14:20,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:14:20,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:14:20,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:14:20,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:14:20,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:14:20,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:14:20,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:14:20,304 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:14:20,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:14:20,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:14:20,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:14:20,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:14:20,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:14:20,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:14:20,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:14:20,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:14:20,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:14:20,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:14:20,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:14:20,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:14:20,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:14:20,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:14:20,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:14:20,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:14:20,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:14:20,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:14:20,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:14:20,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:14:20,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:14:20,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:14:20,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:14:20,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:14:20,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:14:20,340 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:14:20,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:14:20,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:14:20,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:14:20,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:14:20,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:14:20,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:14:20,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:14:20,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:14:20,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:14:20,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:14:20,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:14:20,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:14:20,343 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:14:20,344 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:14:20,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:14:20,344 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:14:20,344 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:14:20,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:14:20,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:14:20,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:14:20,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:14:20,626 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:14:20,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-28 04:14:20,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf61eb71/10df13146ed8407bbebc4d1aecaaea21/FLAGcc6ca547f [2022-04-28 04:14:21,079 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:14:21,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-28 04:14:21,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf61eb71/10df13146ed8407bbebc4d1aecaaea21/FLAGcc6ca547f [2022-04-28 04:14:21,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf61eb71/10df13146ed8407bbebc4d1aecaaea21 [2022-04-28 04:14:21,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:14:21,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:14:21,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:14:21,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:14:21,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:14:21,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2fde75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21, skipping insertion in model container [2022-04-28 04:14:21,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:14:21,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:14:21,656 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/divbin2.i[951,964] [2022-04-28 04:14:21,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:14:21,678 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:14:21,689 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/divbin2.i[951,964] [2022-04-28 04:14:21,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:14:21,706 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:14:21,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21 WrapperNode [2022-04-28 04:14:21,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:14:21,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:14:21,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:14:21,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:14:21,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:14:21,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:14:21,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:14:21,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:14:21,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (1/1) ... [2022-04-28 04:14:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:14:21,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:21,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:14:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:14:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:14:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:14:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:14:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:14:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:14:21,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:14:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:14:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:14:21,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:14:21,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:14:21,978 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:14:21,985 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:14:21,985 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:14:21,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:14:21 BoogieIcfgContainer [2022-04-28 04:14:21,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:14:21,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:14:21,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:14:21,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:14:21,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:14:21" (1/3) ... [2022-04-28 04:14:21,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11df7589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:14:21, skipping insertion in model container [2022-04-28 04:14:21,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:14:21" (2/3) ... [2022-04-28 04:14:21,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11df7589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:14:21, skipping insertion in model container [2022-04-28 04:14:21,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:14:21" (3/3) ... [2022-04-28 04:14:21,996 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2.i [2022-04-28 04:14:22,009 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:14:22,010 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:14:22,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:14:22,053 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14b78fbc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9823826 [2022-04-28 04:14:22,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:14:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:14:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:14:22,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:22,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:22,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 1 times [2022-04-28 04:14:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:22,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201314474] [2022-04-28 04:14:22,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:14:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 2 times [2022-04-28 04:14:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261052264] [2022-04-28 04:14:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:22,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-28 04:14:22,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 04:14:22,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 04:14:22,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:22,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-28 04:14:22,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 04:14:22,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 04:14:22,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2022-04-28 04:14:22,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {27#true} is VALID [2022-04-28 04:14:22,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume false; {28#false} is VALID [2022-04-28 04:14:22,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-28 04:14:22,280 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 04:14:22,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 04:14:22,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 04:14:22,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 04:14:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:22,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261052264] [2022-04-28 04:14:22,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261052264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:22,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:22,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:14:22,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:22,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201314474] [2022-04-28 04:14:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201314474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:22,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:22,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:14:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903360290] [2022-04-28 04:14:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:14:22,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:22,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:22,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:14:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:14:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:14:22,337 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:22,483 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-28 04:14:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:14:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:14:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 04:14:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 04:14:22,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 04:14:22,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:22,568 INFO L225 Difference]: With dead ends: 40 [2022-04-28 04:14:22,569 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:14:22,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:14:22,574 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:22,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:14:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:14:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 04:14:22,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:22,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:22,605 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:22,605 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:22,608 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 04:14:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 04:14:22,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:22,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:22,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 04:14:22,610 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 04:14:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:22,613 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 04:14:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 04:14:22,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:22,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:22,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:22,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 04:14:22,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-28 04:14:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:22,617 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 04:14:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:22,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 04:14:22,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 04:14:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:14:22,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:22,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:22,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:14:22,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:22,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 1 times [2022-04-28 04:14:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183416942] [2022-04-28 04:14:22,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:14:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 2 times [2022-04-28 04:14:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:22,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033261109] [2022-04-28 04:14:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:22,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:14:22,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210222859] [2022-04-28 04:14:22,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:14:22,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:22,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:14:22,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:14:22,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:14:22,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:22,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 04:14:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:22,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:23,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 04:14:23,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-28 04:14:23,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 04:14:23,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #80#return; {191#true} is VALID [2022-04-28 04:14:23,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret2 := main(); {191#true} is VALID [2022-04-28 04:14:23,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:23,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:23,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:23,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:23,201 INFO L272 TraceCheckUtils]: 9: Hoare triple {218#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:14:23,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:14:23,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 04:14:23,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 04:14:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:23,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:14:23,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:23,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033261109] [2022-04-28 04:14:23,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:14:23,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210222859] [2022-04-28 04:14:23,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210222859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:23,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:23,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:14:23,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183416942] [2022-04-28 04:14:23,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183416942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:23,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:23,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:14:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560366302] [2022-04-28 04:14:23,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:23,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 04:14:23,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:23,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:23,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:14:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:14:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:14:23,225 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,426 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 04:14:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:14:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 04:14:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 04:14:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 04:14:23,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 04:14:23,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:23,476 INFO L225 Difference]: With dead ends: 31 [2022-04-28 04:14:23,476 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 04:14:23,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:14:23,478 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:23,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:14:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 04:14:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 04:14:23,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:23,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:23,492 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:23,492 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,494 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 04:14:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 04:14:23,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:23,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:23,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-28 04:14:23,496 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-28 04:14:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:23,498 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 04:14:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 04:14:23,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:23,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:23,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:23,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 04:14:23,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2022-04-28 04:14:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:23,501 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 04:14:23,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:23,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 04:14:23,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 04:14:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:14:23,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:23,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:23,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:14:23,779 WARN L477 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-28 04:14:23,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 1 times [2022-04-28 04:14:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [429129660] [2022-04-28 04:14:23,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:23,795 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:14:23,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:14:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 2 times [2022-04-28 04:14:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:23,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896640877] [2022-04-28 04:14:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:23,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:14:23,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84949640] [2022-04-28 04:14:23,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:14:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:23,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:14:23,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:14:23,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:14:23,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:23,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:14:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:23,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:24,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2022-04-28 04:14:24,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {411#true} is VALID [2022-04-28 04:14:24,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-04-28 04:14:24,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #80#return; {411#true} is VALID [2022-04-28 04:14:24,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret2 := main(); {411#true} is VALID [2022-04-28 04:14:24,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:14:24,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {431#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:14:24,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:14:24,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {412#false} is VALID [2022-04-28 04:14:24,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-04-28 04:14:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:14:24,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:14:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:24,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896640877] [2022-04-28 04:14:24,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:14:24,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84949640] [2022-04-28 04:14:24,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84949640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:24,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:24,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:14:24,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:24,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [429129660] [2022-04-28 04:14:24,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [429129660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:24,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:24,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:14:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525260831] [2022-04-28 04:14:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:14:24,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:24,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:24,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:24,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:14:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:14:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:14:24,053 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,208 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 04:14:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:14:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:14:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 04:14:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 04:14:24,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 04:14:24,246 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-28 04:14:24,248 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:14:24,248 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 04:14:24,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:14:24,249 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:24,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:14:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 04:14:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-28 04:14:24,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:24,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,262 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,262 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,265 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 04:14:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 04:14:24,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:24,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:24,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-28 04:14:24,266 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-28 04:14:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,268 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 04:14:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 04:14:24,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:24,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:24,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:24,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 04:14:24,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-28 04:14:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:24,271 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 04:14:24,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:14:24,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 04:14:24,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 04:14:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:14:24,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:24,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:24,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:14:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:14:24,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 1 times [2022-04-28 04:14:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:24,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [766067582] [2022-04-28 04:14:24,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:14:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 2 times [2022-04-28 04:14:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:24,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985383289] [2022-04-28 04:14:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:24,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:14:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498826484] [2022-04-28 04:14:24,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:14:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:24,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:14:24,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:14:24,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:14:24,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:24,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:14:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:24,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:24,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {666#true} call ULTIMATE.init(); {666#true} is VALID [2022-04-28 04:14:24,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {666#true} is VALID [2022-04-28 04:14:24,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {666#true} assume true; {666#true} is VALID [2022-04-28 04:14:24,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {666#true} {666#true} #80#return; {666#true} is VALID [2022-04-28 04:14:24,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {666#true} call #t~ret2 := main(); {666#true} is VALID [2022-04-28 04:14:24,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {666#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:24,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:24,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:24,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:24,681 INFO L272 TraceCheckUtils]: 9: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {666#true} is VALID [2022-04-28 04:14:24,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#true} ~cond := #in~cond; {666#true} is VALID [2022-04-28 04:14:24,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#true} assume !(0 == ~cond); {666#true} is VALID [2022-04-28 04:14:24,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#true} assume true; {666#true} is VALID [2022-04-28 04:14:24,683 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {666#true} {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #76#return; {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:24,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {667#false} is VALID [2022-04-28 04:14:24,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {667#false} is VALID [2022-04-28 04:14:24,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#false} assume !false; {667#false} is VALID [2022-04-28 04:14:24,685 INFO L272 TraceCheckUtils]: 17: Hoare triple {667#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {667#false} is VALID [2022-04-28 04:14:24,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {667#false} ~cond := #in~cond; {667#false} is VALID [2022-04-28 04:14:24,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {667#false} assume 0 == ~cond; {667#false} is VALID [2022-04-28 04:14:24,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {667#false} assume !false; {667#false} is VALID [2022-04-28 04:14:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:24,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:14:24,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:24,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985383289] [2022-04-28 04:14:24,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:14:24,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498826484] [2022-04-28 04:14:24,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498826484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:24,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:24,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:14:24,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:24,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [766067582] [2022-04-28 04:14:24,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [766067582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:24,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:24,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:14:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422535203] [2022-04-28 04:14:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:24,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 04:14:24,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:24,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:24,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:24,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:14:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:14:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:14:24,706 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,767 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 04:14:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:14:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 04:14:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 04:14:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 04:14:24,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 04:14:24,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:24,812 INFO L225 Difference]: With dead ends: 51 [2022-04-28 04:14:24,813 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:14:24,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:14:24,814 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:14:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:14:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 04:14:24,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:24,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,825 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,826 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,827 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 04:14:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 04:14:24,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:24,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:24,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:14:24,828 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:14:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:24,830 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 04:14:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 04:14:24,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:24,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:24,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:24,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:14:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 04:14:24,832 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2022-04-28 04:14:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:24,832 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 04:14:24,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:14:24,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 04:14:24,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 04:14:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:14:24,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:24,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:24,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:14:25,071 WARN L477 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-28 04:14:25,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 1 times [2022-04-28 04:14:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:25,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153831599] [2022-04-28 04:14:25,078 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:14:25,078 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:14:25,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:14:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 2 times [2022-04-28 04:14:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:25,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692174147] [2022-04-28 04:14:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:25,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:14:25,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766292423] [2022-04-28 04:14:25,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:14:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:14:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:14:25,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:14:25,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:14:25,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:14:25,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:14:25,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 04:14:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:25,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:14:26,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2022-04-28 04:14:26,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {949#true} is VALID [2022-04-28 04:14:26,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 04:14:26,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#true} {949#true} #80#return; {949#true} is VALID [2022-04-28 04:14:26,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2022-04-28 04:14:26,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {969#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:26,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {969#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 04:14:26,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {976#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 04:14:26,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {976#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {976#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 04:14:26,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {976#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 04:14:26,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} assume !false; {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 04:14:26,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {949#true} is VALID [2022-04-28 04:14:26,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#true} ~cond := #in~cond; {949#true} is VALID [2022-04-28 04:14:26,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#true} assume !(0 == ~cond); {949#true} is VALID [2022-04-28 04:14:26,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 04:14:26,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {949#true} {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} #76#return; {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) main_~b~0))} is VALID [2022-04-28 04:14:26,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {983#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296)) (= main_~q~0 0) (= main_~B~0 1) (= (* main_~B~0 2) 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); {1005#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-28 04:14:26,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {1005#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} is VALID [2022-04-28 04:14:26,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} assume !false; {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} is VALID [2022-04-28 04:14:26,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {1009#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (= (+ (- 1) main_~q~0) 0) (= main_~A~0 (+ main_~b~0 main_~r~0)) (not (<= 2 (mod (+ main_~b~0 main_~r~0) 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:14:26,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:14:26,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {950#false} is VALID [2022-04-28 04:14:26,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-04-28 04:14:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:26,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:15:11,220 WARN L232 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:15:23,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-04-28 04:15:23,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {950#false} is VALID [2022-04-28 04:15:23,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:15:23,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:15:23,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-28 04:15:25,938 WARN L290 TraceCheckUtils]: 17: Hoare triple {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 04:15:28,046 WARN L290 TraceCheckUtils]: 16: Hoare triple {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} 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); {1036#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-28 04:15:28,048 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {949#true} {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} #76#return; {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 04:15:28,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 04:15:28,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#true} assume !(0 == ~cond); {949#true} is VALID [2022-04-28 04:15:28,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#true} ~cond := #in~cond; {949#true} is VALID [2022-04-28 04:15:28,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {949#true} is VALID [2022-04-28 04:15:28,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} assume !false; {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 04:15:28,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1046#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)))} is VALID [2022-04-28 04:15:28,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1068#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-28 04:15:30,162 WARN L290 TraceCheckUtils]: 7: Hoare triple {1075#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1068#(or (= (mod main_~B~0 4294967296) (mod main_~b~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-28 04:15:30,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} assume !false; {1075#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-28 04:15:30,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1075#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod (* main_~b~0 2) 4294967296) (mod main_~B~0 4294967296)))} is VALID [2022-04-28 04:15:30,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2022-04-28 04:15:30,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {949#true} {949#true} #80#return; {949#true} is VALID [2022-04-28 04:15:30,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume true; {949#true} is VALID [2022-04-28 04:15:30,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {949#true} is VALID [2022-04-28 04:15:30,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2022-04-28 04:15:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:15:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:30,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692174147] [2022-04-28 04:15:30,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:15:30,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766292423] [2022-04-28 04:15:30,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766292423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:15:30,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:15:30,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-28 04:15:30,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153831599] [2022-04-28 04:15:30,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153831599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:30,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:30,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:15:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124094028] [2022-04-28 04:15:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 04:15:30,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:30,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:15:30,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:30,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:15:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:15:30,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=106, Unknown=7, NotChecked=0, Total=156 [2022-04-28 04:15:30,205 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:15:32,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:15:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:33,697 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 04:15:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:15:33,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 04:15:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:15:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 04:15:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:15:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 04:15:33,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 04:15:33,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:33,930 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:15:33,930 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 04:15:33,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=47, Invalid=128, Unknown=7, NotChecked=0, Total=182 [2022-04-28 04:15:33,932 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:33,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 110 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 04:15:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 04:15:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 04:15:33,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:33,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:15:33,965 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:15:33,966 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:15:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:33,968 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 04:15:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 04:15:33,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:33,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:33,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 04:15:33,969 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 04:15:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:33,971 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 04:15:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 04:15:33,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:33,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:33,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:33,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:15:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 04:15:33,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 23 [2022-04-28 04:15:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:33,974 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 04:15:33,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:15:33,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 04:15:34,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 04:15:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:15:34,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:34,267 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:34,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:15:34,467 WARN L477 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-28 04:15:34,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1013011677, now seen corresponding path program 3 times [2022-04-28 04:15:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:34,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123184987] [2022-04-28 04:15:34,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:15:34,471 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:15:34,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:15:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1013011677, now seen corresponding path program 4 times [2022-04-28 04:15:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:34,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60420380] [2022-04-28 04:15:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:34,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:15:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679549472] [2022-04-28 04:15:34,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:15:34,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:15:34,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:15:34,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:15:34,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process